java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-3-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:33:37,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:33:37,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:33:37,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:33:37,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:33:37,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:33:37,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:33:37,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:33:37,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:33:37,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:33:37,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:33:37,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:33:37,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:33:37,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:33:37,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:33:37,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:33:37,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:33:37,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:33:37,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:33:37,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:33:37,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:33:37,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:33:37,617 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:33:37,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:33:37,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:33:37,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:33:37,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:33:37,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:33:37,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:33:37,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:33:37,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:33:37,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:33:37,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:33:37,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:33:37,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:33:37,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:33:37,627 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:33:37,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:33:37,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:33:37,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:33:37,643 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:33:37,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:33:37,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:33:37,644 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:33:37,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:33:37,644 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:33:37,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:33:37,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:33:37,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:33:37,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:33:37,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:33:37,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:33:37,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:33:37,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:33:37,646 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:33:37,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:33:37,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:33:37,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:33:37,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:33:37,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:33:37,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:37,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:33:37,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:33:37,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:33:37,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:33:37,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:33:37,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:33:37,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:33:37,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:33:37,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:33:37,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:33:37,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:33:37,711 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:33:37,712 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-23 12:33:37,770 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21682055b/18eafcef63e94186ae2223429ba34a47/FLAG2f3cff5ce [2018-11-23 12:33:38,209 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:33:38,210 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-3-n-u_true-unreach-call.i [2018-11-23 12:33:38,218 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21682055b/18eafcef63e94186ae2223429ba34a47/FLAG2f3cff5ce [2018-11-23 12:33:38,574 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21682055b/18eafcef63e94186ae2223429ba34a47 [2018-11-23 12:33:38,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:33:38,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:33:38,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:38,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:33:38,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:33:38,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1065b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38, skipping insertion in model container [2018-11-23 12:33:38,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:33:38,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:33:38,875 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:38,879 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:33:38,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:38,947 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:33:38,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38 WrapperNode [2018-11-23 12:33:38,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:38,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:38,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:33:38,949 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:33:38,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:38,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:33:38,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:33:38,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:33:38,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:38,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:39,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:39,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:39,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... [2018-11-23 12:33:39,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:33:39,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:33:39,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:33:39,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:33:39,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:33:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:33:39,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:33:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:33:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:33:39,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:33:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:33:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:33:39,169 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:33:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:33:39,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:33:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:33:40,109 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:33:40,109 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:33:40,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:40 BoogieIcfgContainer [2018-11-23 12:33:40,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:33:40,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:33:40,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:33:40,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:33:40,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:33:38" (1/3) ... [2018-11-23 12:33:40,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9100e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:40, skipping insertion in model container [2018-11-23 12:33:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:38" (2/3) ... [2018-11-23 12:33:40,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9100e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:40, skipping insertion in model container [2018-11-23 12:33:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:40" (3/3) ... [2018-11-23 12:33:40,120 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-3-n-u_true-unreach-call.i [2018-11-23 12:33:40,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:33:40,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:33:40,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:33:40,196 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:33:40,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:33:40,197 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:33:40,197 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:33:40,197 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:33:40,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:33:40,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:33:40,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:33:40,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:33:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:33:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:33:40,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:40,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:40,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:40,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1773460249, now seen corresponding path program 1 times [2018-11-23 12:33:40,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:40,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:40,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:40,321 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:40,322 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:40,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:40,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:40,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:40,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:33:40,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:33:40,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:33:40,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #138#return; {39#true} is VALID [2018-11-23 12:33:40,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret4 := main(); {39#true} is VALID [2018-11-23 12:33:40,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {39#true} is VALID [2018-11-23 12:33:40,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:33:40,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:40,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:33:40,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:40,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:40,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:40,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {40#false} is VALID [2018-11-23 12:33:40,517 INFO L256 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {40#false} is VALID [2018-11-23 12:33:40,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 12:33:40,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 12:33:40,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:33:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:40,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:40,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:33:40,549 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:33:40,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:40,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:33:40,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:40,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:33:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:33:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:33:40,601 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:33:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:40,854 INFO L93 Difference]: Finished difference Result 66 states and 103 transitions. [2018-11-23 12:33:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:33:40,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:33:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:33:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:33:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:33:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:33:40,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2018-11-23 12:33:41,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:41,448 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:33:41,448 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:33:41,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:33:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:33:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:33:41,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:41,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:41,624 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:41,624 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:41,631 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:33:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:41,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:41,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:41,633 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:41,633 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:41,638 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:33:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:41,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:41,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:41,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:41,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:33:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 12:33:41,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2018-11-23 12:33:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:41,647 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 12:33:41,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:33:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:33:41,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:41,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:41,650 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:41,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1763514787, now seen corresponding path program 1 times [2018-11-23 12:33:41,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:41,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:41,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:41,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:41,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:41,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:41,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:41,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:41,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:41,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 12:33:41,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-23 12:33:41,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 12:33:41,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #138#return; {291#true} is VALID [2018-11-23 12:33:41,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret4 := main(); {291#true} is VALID [2018-11-23 12:33:41,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {311#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:41,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {292#false} is VALID [2018-11-23 12:33:41,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:41,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !(~i~0 < ~m~0); {292#false} is VALID [2018-11-23 12:33:41,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:41,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:41,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:41,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {292#false} is VALID [2018-11-23 12:33:41,886 INFO L256 TraceCheckUtils]: 13: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {292#false} is VALID [2018-11-23 12:33:41,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 12:33:41,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2018-11-23 12:33:41,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 12:33:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:41,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:41,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:33:41,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:33:41,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:41,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:33:42,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:42,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:33:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:33:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:42,046 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-11-23 12:33:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:42,503 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-11-23 12:33:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:33:42,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:33:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:33:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:33:42,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:33:42,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:42,668 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:33:42,668 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:33:42,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:33:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 12:33:42,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:42,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:42,725 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:42,725 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:42,728 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:33:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:33:42,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:42,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:42,729 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-23 12:33:42,730 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-23 12:33:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:42,733 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:33:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:33:42,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:42,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:42,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:42,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:33:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:33:42,737 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2018-11-23 12:33:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:42,737 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:33:42,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:33:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:33:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:33:42,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:42,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:42,739 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:42,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2133227694, now seen corresponding path program 1 times [2018-11-23 12:33:42,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:42,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:42,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:42,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:42,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:42,747 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:42,748 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:42,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:42,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:42,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:42,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-23 12:33:42,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {546#true} is VALID [2018-11-23 12:33:42,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-23 12:33:42,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #138#return; {546#true} is VALID [2018-11-23 12:33:42,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret4 := main(); {546#true} is VALID [2018-11-23 12:33:42,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {546#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {566#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:42,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {570#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:42,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {547#false} is VALID [2018-11-23 12:33:42,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {547#false} ~i~0 := 1 + ~i~0; {547#false} is VALID [2018-11-23 12:33:42,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {547#false} assume !(~i~0 < ~m~0); {547#false} is VALID [2018-11-23 12:33:42,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:42,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#false} assume !(~i~0 < ~m~0); {547#false} is VALID [2018-11-23 12:33:42,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:42,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:42,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {547#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:42,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {547#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {547#false} is VALID [2018-11-23 12:33:42,926 INFO L256 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {547#false} is VALID [2018-11-23 12:33:42,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2018-11-23 12:33:42,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2018-11-23 12:33:42,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-23 12:33:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:42,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:42,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:42,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:33:42,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:42,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:42,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:42,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:42,988 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:33:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:43,300 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2018-11-23 12:33:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:43,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:33:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:33:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:33:43,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2018-11-23 12:33:43,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:43,475 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:33:43,475 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:33:43,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:33:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 12:33:43,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:43,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 35 states. [2018-11-23 12:33:43,531 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 35 states. [2018-11-23 12:33:43,531 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 35 states. [2018-11-23 12:33:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:43,537 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:33:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:33:43,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:43,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:43,538 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states. [2018-11-23 12:33:43,538 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states. [2018-11-23 12:33:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:43,542 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:33:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:33:43,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:43,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:43,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:43,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:33:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 12:33:43,546 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2018-11-23 12:33:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:43,546 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 12:33:43,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:33:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:33:43,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:43,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:43,548 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:43,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1108398309, now seen corresponding path program 1 times [2018-11-23 12:33:43,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:43,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:43,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:43,556 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:43,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:43,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:43,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:43,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {862#true} is VALID [2018-11-23 12:33:43,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {862#true} is VALID [2018-11-23 12:33:43,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2018-11-23 12:33:43,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #138#return; {862#true} is VALID [2018-11-23 12:33:43,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret4 := main(); {862#true} is VALID [2018-11-23 12:33:43,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {882#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:43,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {882#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {882#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:43,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {882#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {889#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:43,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {863#false} is VALID [2018-11-23 12:33:43,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#false} ~j~0 := 1 + ~j~0; {863#false} is VALID [2018-11-23 12:33:43,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#false} assume !(~j~0 < ~n~0); {863#false} is VALID [2018-11-23 12:33:43,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#false} ~i~0 := 1 + ~i~0; {863#false} is VALID [2018-11-23 12:33:43,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#false} assume !(~i~0 < ~m~0); {863#false} is VALID [2018-11-23 12:33:43,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:43,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#false} assume !(~i~0 < ~m~0); {863#false} is VALID [2018-11-23 12:33:43,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:43,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {863#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:43,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:43,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {863#false} is VALID [2018-11-23 12:33:43,689 INFO L256 TraceCheckUtils]: 19: Hoare triple {863#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {863#false} is VALID [2018-11-23 12:33:43,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {863#false} ~cond := #in~cond; {863#false} is VALID [2018-11-23 12:33:43,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {863#false} assume 0 == ~cond; {863#false} is VALID [2018-11-23 12:33:43,690 INFO L273 TraceCheckUtils]: 22: Hoare triple {863#false} assume !false; {863#false} is VALID [2018-11-23 12:33:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:43,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:43,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:33:43,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:43,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:43,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:43,755 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2018-11-23 12:33:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:44,101 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 12:33:44,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:44,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:33:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:33:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:33:44,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2018-11-23 12:33:44,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:44,221 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:33:44,222 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:33:44,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:33:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-23 12:33:44,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:44,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2018-11-23 12:33:44,337 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2018-11-23 12:33:44,337 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2018-11-23 12:33:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:44,340 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:33:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:33:44,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:44,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:44,341 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2018-11-23 12:33:44,342 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2018-11-23 12:33:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:44,345 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:33:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:33:44,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:44,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:44,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:44,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:33:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:33:44,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 23 [2018-11-23 12:33:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:44,349 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:33:44,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:33:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:33:44,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:44,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:44,351 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:44,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1602833213, now seen corresponding path program 1 times [2018-11-23 12:33:44,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:44,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:44,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:44,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:44,360 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:44,360 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:44,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:44,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:44,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:44,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-23 12:33:44,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-23 12:33:44,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-23 12:33:44,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #138#return; {1190#true} is VALID [2018-11-23 12:33:44,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret4 := main(); {1190#true} is VALID [2018-11-23 12:33:44,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1210#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:44,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1210#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:44,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1217#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:44,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1221#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:44,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {1221#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1191#false} is VALID [2018-11-23 12:33:44,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {1191#false} ~j~0 := 1 + ~j~0; {1191#false} is VALID [2018-11-23 12:33:44,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} assume !(~j~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:33:44,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} ~i~0 := 1 + ~i~0; {1191#false} is VALID [2018-11-23 12:33:44,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !(~i~0 < ~m~0); {1191#false} is VALID [2018-11-23 12:33:44,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:44,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume !(~i~0 < ~m~0); {1191#false} is VALID [2018-11-23 12:33:44,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:44,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:44,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:44,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1191#false} is VALID [2018-11-23 12:33:44,549 INFO L256 TraceCheckUtils]: 20: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1191#false} is VALID [2018-11-23 12:33:44,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-23 12:33:44,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume 0 == ~cond; {1191#false} is VALID [2018-11-23 12:33:44,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-23 12:33:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:44,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:44,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:44,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:33:44,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:44,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:44,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:44,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:44,611 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 12:33:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:44,943 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:33:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:44,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:33:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:33:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:33:44,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:33:45,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:45,108 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:33:45,108 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:33:45,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:33:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-23 12:33:45,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:45,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 43 states. [2018-11-23 12:33:45,230 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 43 states. [2018-11-23 12:33:45,230 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 43 states. [2018-11-23 12:33:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:45,233 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:33:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:33:45,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:45,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:45,235 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 48 states. [2018-11-23 12:33:45,235 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 48 states. [2018-11-23 12:33:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:45,238 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:33:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:33:45,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:45,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:45,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:45,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:33:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 12:33:45,242 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 24 [2018-11-23 12:33:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:45,242 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:33:45,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:33:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:33:45,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:45,244 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:45,244 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:45,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 249553947, now seen corresponding path program 2 times [2018-11-23 12:33:45,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:45,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:45,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:45,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:45,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:45,252 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:45,252 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:45,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:45,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:45,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:33:45,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:45,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:45,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2018-11-23 12:33:45,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {1556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1556#true} is VALID [2018-11-23 12:33:45,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2018-11-23 12:33:45,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #138#return; {1556#true} is VALID [2018-11-23 12:33:45,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret4 := main(); {1556#true} is VALID [2018-11-23 12:33:45,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {1556#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {1576#(<= 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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {1576#(<= 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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {1576#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {1576#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:45,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1607#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:45,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {1607#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1557#false} is VALID [2018-11-23 12:33:45,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {1557#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:33:45,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:33:45,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1557#false} is VALID [2018-11-23 12:33:45,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1557#false} is VALID [2018-11-23 12:33:45,436 INFO L256 TraceCheckUtils]: 21: Hoare triple {1557#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1557#false} is VALID [2018-11-23 12:33:45,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {1557#false} ~cond := #in~cond; {1557#false} is VALID [2018-11-23 12:33:45,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {1557#false} assume 0 == ~cond; {1557#false} is VALID [2018-11-23 12:33:45,438 INFO L273 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2018-11-23 12:33:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:33:45,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:45,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:45,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:33:45,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:45,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:45,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:45,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:45,496 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2018-11-23 12:33:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:46,079 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 12:33:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:46,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:33:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:33:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:33:46,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-23 12:33:46,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:46,210 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:33:46,211 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:33:46,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:33:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2018-11-23 12:33:46,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:46,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 44 states. [2018-11-23 12:33:46,322 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 44 states. [2018-11-23 12:33:46,323 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 44 states. [2018-11-23 12:33:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:46,326 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:33:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:33:46,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:46,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:46,328 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 70 states. [2018-11-23 12:33:46,328 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 70 states. [2018-11-23 12:33:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:46,332 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:33:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:33:46,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:46,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:46,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:46,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:33:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:33:46,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 25 [2018-11-23 12:33:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:46,336 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:33:46,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:33:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:33:46,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:46,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:46,337 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:46,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:46,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1698801625, now seen corresponding path program 1 times [2018-11-23 12:33:46,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:46,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:46,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:46,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:46,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:46,348 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:46,348 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:46,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:46,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:46,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:47,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1988#true} is VALID [2018-11-23 12:33:47,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {1988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1988#true} is VALID [2018-11-23 12:33:47,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2018-11-23 12:33:47,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #138#return; {1988#true} is VALID [2018-11-23 12:33:47,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret4 := main(); {1988#true} is VALID [2018-11-23 12:33:47,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {1988#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2008#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:47,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {2008#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2008#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:47,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {2008#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2015#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:47,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {2015#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2019#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:47,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {2019#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2023#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:33:47,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {1989#false} is VALID [2018-11-23 12:33:47,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:33:47,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:33:47,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:33:47,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {1989#false} assume !(~i~0 < ~m~0); {1989#false} is VALID [2018-11-23 12:33:47,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:47,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {1989#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:47,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:47,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:33:47,073 INFO L273 TraceCheckUtils]: 19: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:33:47,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {1989#false} assume !(~k~0 < ~p~0); {1989#false} is VALID [2018-11-23 12:33:47,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:33:47,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:33:47,075 INFO L273 TraceCheckUtils]: 23: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:33:47,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {1989#false} assume !(~i~0 < ~m~0); {1989#false} is VALID [2018-11-23 12:33:47,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:47,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {1989#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:47,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:47,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1989#false} is VALID [2018-11-23 12:33:47,076 INFO L256 TraceCheckUtils]: 29: Hoare triple {1989#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1989#false} is VALID [2018-11-23 12:33:47,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2018-11-23 12:33:47,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2018-11-23 12:33:47,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2018-11-23 12:33:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:33:47,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:47,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:33:47,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:33:47,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:47,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:33:47,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:47,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:33:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:33:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:47,177 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2018-11-23 12:33:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:47,898 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2018-11-23 12:33:47,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:33:47,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:33:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:33:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:33:47,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 12:33:48,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:48,017 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:33:48,017 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:33:48,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:33:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 12:33:48,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:48,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 12:33:48,263 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 12:33:48,263 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 12:33:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:48,267 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:33:48,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:48,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:48,268 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 12:33:48,268 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 12:33:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:48,275 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:33:48,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:48,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:48,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:48,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:33:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-23 12:33:48,279 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 33 [2018-11-23 12:33:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:48,279 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-23 12:33:48,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:33:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 12:33:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:33:48,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:48,281 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:48,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:48,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash -602786922, now seen corresponding path program 2 times [2018-11-23 12:33:48,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:48,292 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:48,292 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:48,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:48,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:48,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:33:48,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:48,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:48,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2420#true} is VALID [2018-11-23 12:33:48,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {2420#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2420#true} is VALID [2018-11-23 12:33:48,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2018-11-23 12:33:48,522 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #138#return; {2420#true} is VALID [2018-11-23 12:33:48,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret4 := main(); {2420#true} is VALID [2018-11-23 12:33:48,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {2420#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2440#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:48,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {2440#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2440#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:48,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {2440#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2447#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:48,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {2447#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2451#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:48,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {2451#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2455#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:33:48,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2459#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:33:48,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !(~k~0 < ~p~0); {2421#false} is VALID [2018-11-23 12:33:48,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:33:48,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:33:48,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:33:48,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {2421#false} assume !(~i~0 < ~m~0); {2421#false} is VALID [2018-11-23 12:33:48,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:48,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {2421#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:48,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:48,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:33:48,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:33:48,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:33:48,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {2421#false} assume !(~k~0 < ~p~0); {2421#false} is VALID [2018-11-23 12:33:48,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:33:48,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:33:48,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:33:48,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {2421#false} assume !(~i~0 < ~m~0); {2421#false} is VALID [2018-11-23 12:33:48,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:48,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {2421#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:48,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:48,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2421#false} is VALID [2018-11-23 12:33:48,532 INFO L256 TraceCheckUtils]: 31: Hoare triple {2421#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2421#false} is VALID [2018-11-23 12:33:48,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {2421#false} ~cond := #in~cond; {2421#false} is VALID [2018-11-23 12:33:48,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {2421#false} assume 0 == ~cond; {2421#false} is VALID [2018-11-23 12:33:48,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2018-11-23 12:33:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:33:48,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:48,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:33:48,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:33:48,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:48,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:33:48,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:48,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:33:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:33:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:48,602 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 7 states. [2018-11-23 12:33:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:49,103 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2018-11-23 12:33:49,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:33:49,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:33:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:33:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:33:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:33:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:33:49,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-23 12:33:49,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:49,269 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:33:49,270 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:33:49,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:33:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-23 12:33:49,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:49,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-23 12:33:49,397 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-23 12:33:49,397 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-23 12:33:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:49,400 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:33:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:33:49,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:49,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:49,401 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-23 12:33:49,401 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-23 12:33:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:49,404 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:33:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:33:49,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:49,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:49,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:49,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:33:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-23 12:33:49,407 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 35 [2018-11-23 12:33:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:49,408 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-23 12:33:49,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:33:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:33:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:33:49,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:49,409 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:49,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:49,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -119527047, now seen corresponding path program 3 times [2018-11-23 12:33:49,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:49,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:49,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:49,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:49,416 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:49,416 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:49,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:33:49,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:33:49,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:49,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:49,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {2896#true} call ULTIMATE.init(); {2896#true} is VALID [2018-11-23 12:33:49,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {2896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2896#true} is VALID [2018-11-23 12:33:49,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {2896#true} assume true; {2896#true} is VALID [2018-11-23 12:33:49,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2896#true} {2896#true} #138#return; {2896#true} is VALID [2018-11-23 12:33:49,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {2896#true} call #t~ret4 := main(); {2896#true} is VALID [2018-11-23 12:33:49,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {2896#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {2916#(<= 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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {2916#(<= 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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {2916#(<= 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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {2916#(<= 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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {2916#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {2916#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:49,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {2916#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := 1 + ~j~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,668 INFO L273 TraceCheckUtils]: 27: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2984#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:49,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {2984#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2897#false} is VALID [2018-11-23 12:33:49,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {2897#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:33:49,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {2897#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:33:49,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {2897#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2897#false} is VALID [2018-11-23 12:33:49,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {2897#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2897#false} is VALID [2018-11-23 12:33:49,671 INFO L256 TraceCheckUtils]: 33: Hoare triple {2897#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2897#false} is VALID [2018-11-23 12:33:49,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {2897#false} ~cond := #in~cond; {2897#false} is VALID [2018-11-23 12:33:49,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {2897#false} assume 0 == ~cond; {2897#false} is VALID [2018-11-23 12:33:49,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {2897#false} assume !false; {2897#false} is VALID [2018-11-23 12:33:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:33:49,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:49,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:33:49,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:49,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:49,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:49,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:49,745 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-11-23 12:33:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:50,491 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2018-11-23 12:33:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:50,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:33:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:33:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:33:50,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2018-11-23 12:33:50,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:50,629 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:33:50,629 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:33:50,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:33:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 74. [2018-11-23 12:33:50,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:50,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 74 states. [2018-11-23 12:33:50,949 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 74 states. [2018-11-23 12:33:50,950 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 74 states. [2018-11-23 12:33:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:50,956 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:33:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:33:50,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:50,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:50,957 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 128 states. [2018-11-23 12:33:50,957 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 128 states. [2018-11-23 12:33:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:50,962 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:33:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:33:50,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:50,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:50,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:50,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:33:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-23 12:33:50,965 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 37 [2018-11-23 12:33:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:50,966 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-23 12:33:50,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-23 12:33:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:33:50,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:50,967 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:50,967 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:50,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1459343723, now seen corresponding path program 4 times [2018-11-23 12:33:50,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:50,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:50,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:50,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:50,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:50,974 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:50,975 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:50,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:50,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:33:51,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:33:51,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:51,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:51,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {3668#true} call ULTIMATE.init(); {3668#true} is VALID [2018-11-23 12:33:51,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {3668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3668#true} is VALID [2018-11-23 12:33:51,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {3668#true} assume true; {3668#true} is VALID [2018-11-23 12:33:51,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3668#true} {3668#true} #138#return; {3668#true} is VALID [2018-11-23 12:33:51,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {3668#true} call #t~ret4 := main(); {3668#true} is VALID [2018-11-23 12:33:51,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {3668#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(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3688#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:51,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {3688#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {3692#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {3692#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {3692#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~k~0 < ~p~0); {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {3692#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} ~j~0 := 1 + ~j~0; {3714#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:33:51,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {3714#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:33:51,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:33:51,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {3669#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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {3669#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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#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 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:33:51,368 INFO L273 TraceCheckUtils]: 23: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:33:51,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:33:51,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:33:51,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {3669#false} assume !(~i~0 < ~m~0); {3669#false} is VALID [2018-11-23 12:33:51,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,370 INFO L273 TraceCheckUtils]: 29: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,371 INFO L273 TraceCheckUtils]: 34: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:33:51,371 INFO L273 TraceCheckUtils]: 35: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:33:51,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:33:51,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:33:51,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,372 INFO L273 TraceCheckUtils]: 39: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 44: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 45: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 47: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {3669#false} assume !(~i~0 < ~m~0); {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:33:51,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3669#false} is VALID [2018-11-23 12:33:51,374 INFO L256 TraceCheckUtils]: 53: Hoare triple {3669#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3669#false} is VALID [2018-11-23 12:33:51,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {3669#false} ~cond := #in~cond; {3669#false} is VALID [2018-11-23 12:33:51,374 INFO L273 TraceCheckUtils]: 55: Hoare triple {3669#false} assume 0 == ~cond; {3669#false} is VALID [2018-11-23 12:33:51,375 INFO L273 TraceCheckUtils]: 56: Hoare triple {3669#false} assume !false; {3669#false} is VALID [2018-11-23 12:33:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:33:51,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:51,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:51,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-23 12:33:51,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:51,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:51,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:51,436 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 5 states. [2018-11-23 12:33:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:52,996 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2018-11-23 12:33:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:52,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-23 12:33:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2018-11-23 12:33:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2018-11-23 12:33:53,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 108 transitions. [2018-11-23 12:33:53,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:53,170 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:33:53,170 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 12:33:53,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 12:33:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 117. [2018-11-23 12:33:53,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:53,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 117 states. [2018-11-23 12:33:53,812 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 117 states. [2018-11-23 12:33:53,812 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 117 states. [2018-11-23 12:33:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,818 INFO L93 Difference]: Finished difference Result 156 states and 189 transitions. [2018-11-23 12:33:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2018-11-23 12:33:53,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:53,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:53,819 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 156 states. [2018-11-23 12:33:53,819 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 156 states. [2018-11-23 12:33:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,825 INFO L93 Difference]: Finished difference Result 156 states and 189 transitions. [2018-11-23 12:33:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2018-11-23 12:33:53,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:53,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:53,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:53,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 12:33:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2018-11-23 12:33:53,830 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 57 [2018-11-23 12:33:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:53,830 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2018-11-23 12:33:53,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2018-11-23 12:33:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:33:53,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:53,832 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:53,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:53,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash -371257155, now seen corresponding path program 5 times [2018-11-23 12:33:53,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:53,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:53,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:53,841 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:53,841 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:53,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1