java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:59:01,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:59:01,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:59:01,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:59:01,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:59:01,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:59:01,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:59:01,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:59:01,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:59:01,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:59:01,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:59:01,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:59:01,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:59:01,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:59:01,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:59:01,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:59:01,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:59:01,525 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:59:01,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:59:01,529 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:59:01,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:59:01,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:59:01,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:59:01,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:59:01,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:59:01,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:59:01,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:59:01,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:59:01,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:59:01,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:59:01,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:59:01,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:59:01,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:59:01,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:59:01,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:59:01,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:59:01,545 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:59:01,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:59:01,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:59:01,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:59:01,574 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:59:01,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:59:01,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:59:01,575 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:59:01,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:59:01,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:59:01,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:59:01,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:59:01,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:59:01,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:59:01,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:59:01,580 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:59:01,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:59:01,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:59:01,580 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:59:01,581 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:59:01,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:59:01,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:59:01,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:59:01,582 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:59:01,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:01,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:59:01,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:59:01,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:59:01,588 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:59:01,588 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:59:01,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:59:01,588 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:59:01,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:59:01,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:59:01,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:59:01,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:59:01,671 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:59:01,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i [2018-11-14 18:59:01,731 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e40eda9/481d0737e9fd4318bd98a7760b5f5d13/FLAG32fe7c645 [2018-11-14 18:59:02,177 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:59:02,178 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i [2018-11-14 18:59:02,188 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e40eda9/481d0737e9fd4318bd98a7760b5f5d13/FLAG32fe7c645 [2018-11-14 18:59:02,207 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e40eda9/481d0737e9fd4318bd98a7760b5f5d13 [2018-11-14 18:59:02,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:59:02,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:59:02,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:02,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:59:02,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:59:02,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7855a5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02, skipping insertion in model container [2018-11-14 18:59:02,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:59:02,265 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:59:02,484 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:02,489 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:59:02,523 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:02,553 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:59:02,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02 WrapperNode [2018-11-14 18:59:02,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:02,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:59:02,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:59:02,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:59:02,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... [2018-11-14 18:59:02,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:59:02,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:59:02,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:59:02,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:59:02,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:02,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:59:02,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:59:02,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:59:02,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:59:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:59:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:59:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:59:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:59:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:59:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:59:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:59:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:59:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:59:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:59:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:59:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:59:03,762 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:59:03,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:03 BoogieIcfgContainer [2018-11-14 18:59:03,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:59:03,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:59:03,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:59:03,768 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:59:03,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:59:02" (1/3) ... [2018-11-14 18:59:03,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72065736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:03, skipping insertion in model container [2018-11-14 18:59:03,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:02" (2/3) ... [2018-11-14 18:59:03,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72065736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:03, skipping insertion in model container [2018-11-14 18:59:03,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:03" (3/3) ... [2018-11-14 18:59:03,772 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u_true-unreach-call.i [2018-11-14 18:59:03,782 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:59:03,791 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:59:03,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:59:03,842 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:59:03,843 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:59:03,843 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:59:03,843 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:59:03,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:59:03,844 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:59:03,844 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:59:03,844 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:59:03,844 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:59:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 18:59:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:59:03,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:03,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:03,881 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:03,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1945566331, now seen corresponding path program 1 times [2018-11-14 18:59:03,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:03,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:03,968 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:03,969 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:03,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:03,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:04,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:04,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 18:59:04,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-14 18:59:04,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 18:59:04,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-14 18:59:04,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2018-11-14 18:59:04,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {48#true} is VALID [2018-11-14 18:59:04,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-14 18:59:04,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 18:59:04,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-14 18:59:04,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 18:59:04,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 18:59:04,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 18:59:04,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 18:59:04,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {49#false} is VALID [2018-11-14 18:59:04,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 18:59:04,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {49#false} is VALID [2018-11-14 18:59:04,116 INFO L256 TraceCheckUtils]: 16: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {49#false} is VALID [2018-11-14 18:59:04,116 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-14 18:59:04,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume ~cond == 0; {49#false} is VALID [2018-11-14 18:59:04,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 18:59:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:04,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:59:04,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:59:04,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:04,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:59:04,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:04,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:59:04,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:59:04,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:04,301 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-14 18:59:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:04,510 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2018-11-14 18:59:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:59:04,511 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:59:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 18:59:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 18:59:04,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-14 18:59:05,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:05,297 INFO L225 Difference]: With dead ends: 84 [2018-11-14 18:59:05,298 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:59:05,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:59:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 18:59:05,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:05,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 18:59:05,519 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:59:05,519 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:59:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:05,527 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 18:59:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 18:59:05,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:05,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:05,529 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:59:05,529 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:59:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:05,535 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 18:59:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 18:59:05,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:05,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:05,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:05,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:59:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-14 18:59:05,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2018-11-14 18:59:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:05,543 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-14 18:59:05,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:59:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 18:59:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:59:05,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:05,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:05,545 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:05,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1304843137, now seen corresponding path program 1 times [2018-11-14 18:59:05,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:05,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:05,555 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:05,556 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:05,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:05,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:05,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:05,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2018-11-14 18:59:05,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {354#true} is VALID [2018-11-14 18:59:05,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2018-11-14 18:59:05,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #147#return; {354#true} is VALID [2018-11-14 18:59:05,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret5 := main(); {354#true} is VALID [2018-11-14 18:59:05,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {374#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:05,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(and (<= 500 main_~p~0) (<= main_~i~0 0))} assume true; {374#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:05,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(and (<= 500 main_~p~0) (<= main_~i~0 0))} assume !(~i~0 < ~p~0); {355#false} is VALID [2018-11-14 18:59:05,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 18:59:05,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:59:05,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {355#false} assume !(~i~0 < ~p~0); {355#false} is VALID [2018-11-14 18:59:05,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 18:59:05,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:59:05,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {355#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 18:59:05,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:59:05,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {355#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {355#false} is VALID [2018-11-14 18:59:05,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:59:05,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {355#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {355#false} is VALID [2018-11-14 18:59:05,908 INFO L256 TraceCheckUtils]: 18: Hoare triple {355#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {355#false} is VALID [2018-11-14 18:59:05,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {355#false} ~cond := #in~cond; {355#false} is VALID [2018-11-14 18:59:05,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {355#false} assume ~cond == 0; {355#false} is VALID [2018-11-14 18:59:05,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {355#false} assume !false; {355#false} is VALID [2018-11-14 18:59:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:05,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:59:05,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:59:05,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:05,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:59:06,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:06,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:59:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:59:06,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:06,044 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-14 18:59:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:06,362 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 18:59:06,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:59:06,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:59:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 18:59:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 18:59:06,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-14 18:59:06,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:06,633 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:59:06,633 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:59:06,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:59:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-14 18:59:06,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:06,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2018-11-14 18:59:06,659 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2018-11-14 18:59:06,660 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2018-11-14 18:59:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:06,663 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 18:59:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 18:59:06,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:06,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:06,664 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2018-11-14 18:59:06,664 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2018-11-14 18:59:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:06,668 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 18:59:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 18:59:06,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:06,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:06,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:06,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:59:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-14 18:59:06,672 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2018-11-14 18:59:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:06,673 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-14 18:59:06,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:59:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 18:59:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:59:06,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:06,674 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:06,675 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:06,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash -272598018, now seen corresponding path program 1 times [2018-11-14 18:59:06,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:06,683 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:06,684 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:06,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:06,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:06,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:06,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 18:59:06,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-14 18:59:06,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 18:59:06,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #147#return; {676#true} is VALID [2018-11-14 18:59:06,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret5 := main(); {676#true} is VALID [2018-11-14 18:59:06,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {696#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:06,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= 500 main_~p~0)} assume true; {696#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:06,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {703#(and (<= 500 main_~p~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:06,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(and (<= 500 main_~p~0) (<= main_~j~0 0))} assume true; {703#(and (<= 500 main_~p~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:07,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {703#(and (<= 500 main_~p~0) (<= main_~j~0 0))} assume !(~j~0 < ~p~0); {677#false} is VALID [2018-11-14 18:59:07,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#false} ~i~0 := ~i~0 + 1; {677#false} is VALID [2018-11-14 18:59:07,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:59:07,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#false} assume !(~i~0 < ~p~0); {677#false} is VALID [2018-11-14 18:59:07,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 18:59:07,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:59:07,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {677#false} assume !(~i~0 < ~p~0); {677#false} is VALID [2018-11-14 18:59:07,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 18:59:07,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:59:07,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {677#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 18:59:07,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:59:07,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {677#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {677#false} is VALID [2018-11-14 18:59:07,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:59:07,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {677#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {677#false} is VALID [2018-11-14 18:59:07,006 INFO L256 TraceCheckUtils]: 23: Hoare triple {677#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {677#false} is VALID [2018-11-14 18:59:07,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {677#false} ~cond := #in~cond; {677#false} is VALID [2018-11-14 18:59:07,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {677#false} assume ~cond == 0; {677#false} is VALID [2018-11-14 18:59:07,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 18:59:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:07,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:07,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:07,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 18:59:07,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:07,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:07,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:07,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:07,068 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 4 states. [2018-11-14 18:59:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:07,422 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2018-11-14 18:59:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:07,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 18:59:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2018-11-14 18:59:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2018-11-14 18:59:07,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2018-11-14 18:59:07,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:07,613 INFO L225 Difference]: With dead ends: 99 [2018-11-14 18:59:07,613 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 18:59:07,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 18:59:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-11-14 18:59:07,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:07,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 46 states. [2018-11-14 18:59:07,667 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 46 states. [2018-11-14 18:59:07,667 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 46 states. [2018-11-14 18:59:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:07,673 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 18:59:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-14 18:59:07,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:07,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:07,674 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 65 states. [2018-11-14 18:59:07,674 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 65 states. [2018-11-14 18:59:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:07,679 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 18:59:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-14 18:59:07,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:07,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:07,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:07,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 18:59:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-14 18:59:07,683 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 27 [2018-11-14 18:59:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:07,683 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-14 18:59:07,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-14 18:59:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:59:07,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:07,685 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:07,685 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:07,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1346161551, now seen corresponding path program 1 times [2018-11-14 18:59:07,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:07,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:07,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:07,694 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:07,695 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:07,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:07,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:07,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:07,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {1089#true} call ULTIMATE.init(); {1089#true} is VALID [2018-11-14 18:59:07,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {1089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1089#true} is VALID [2018-11-14 18:59:07,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {1089#true} assume true; {1089#true} is VALID [2018-11-14 18:59:07,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} #147#return; {1089#true} is VALID [2018-11-14 18:59:07,901 INFO L256 TraceCheckUtils]: 4: Hoare triple {1089#true} call #t~ret5 := main(); {1089#true} is VALID [2018-11-14 18:59:07,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {1089#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1109#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:07,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {1109#(<= 500 main_~p~0)} assume true; {1109#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:07,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {1109#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:07,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(<= 500 main_~p~0)} assume true; {1109#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:07,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1109#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {1122#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:07,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1122#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume true; {1122#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:07,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1122#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {1090#false} is VALID [2018-11-14 18:59:07,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#false} ~j~0 := ~j~0 + 1; {1090#false} is VALID [2018-11-14 18:59:07,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:59:07,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#false} assume !(~j~0 < ~p~0); {1090#false} is VALID [2018-11-14 18:59:07,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#false} ~i~0 := ~i~0 + 1; {1090#false} is VALID [2018-11-14 18:59:07,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:59:07,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {1090#false} assume !(~i~0 < ~p~0); {1090#false} is VALID [2018-11-14 18:59:07,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 18:59:07,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:59:07,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#false} assume !(~i~0 < ~p~0); {1090#false} is VALID [2018-11-14 18:59:07,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 18:59:07,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:59:07,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {1090#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 18:59:07,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:59:07,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {1090#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1090#false} is VALID [2018-11-14 18:59:07,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:59:07,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {1090#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {1090#false} is VALID [2018-11-14 18:59:07,912 INFO L256 TraceCheckUtils]: 28: Hoare triple {1090#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1090#false} is VALID [2018-11-14 18:59:07,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {1090#false} ~cond := #in~cond; {1090#false} is VALID [2018-11-14 18:59:07,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {1090#false} assume ~cond == 0; {1090#false} is VALID [2018-11-14 18:59:07,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2018-11-14 18:59:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:07,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:07,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:07,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 18:59:07,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:07,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:07,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:07,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:07,972 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 4 states. [2018-11-14 18:59:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:08,236 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-14 18:59:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:08,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 18:59:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-14 18:59:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-14 18:59:08,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-14 18:59:08,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:08,424 INFO L225 Difference]: With dead ends: 101 [2018-11-14 18:59:08,425 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 18:59:08,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 18:59:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2018-11-14 18:59:08,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:08,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 50 states. [2018-11-14 18:59:08,474 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 50 states. [2018-11-14 18:59:08,474 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 50 states. [2018-11-14 18:59:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:08,477 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-14 18:59:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-14 18:59:08,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:08,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:08,479 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 63 states. [2018-11-14 18:59:08,479 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 63 states. [2018-11-14 18:59:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:08,483 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-14 18:59:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-14 18:59:08,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:08,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:08,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:08,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:59:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-14 18:59:08,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 32 [2018-11-14 18:59:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:08,487 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-14 18:59:08,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-14 18:59:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:59:08,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:08,489 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:08,489 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:08,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1109010455, now seen corresponding path program 1 times [2018-11-14 18:59:08,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:08,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:08,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:08,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:08,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:08,497 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:08,498 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:08,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:08,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:08,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2018-11-14 18:59:08,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {1523#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1523#true} is VALID [2018-11-14 18:59:08,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-14 18:59:08,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #147#return; {1523#true} is VALID [2018-11-14 18:59:08,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret5 := main(); {1523#true} is VALID [2018-11-14 18:59:08,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {1523#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1543#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:08,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {1543#(<= 500 main_~p~0)} assume true; {1543#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:08,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {1543#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {1543#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:08,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {1543#(<= 500 main_~p~0)} assume true; {1543#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:08,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {1543#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {1556#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:08,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {1556#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume true; {1556#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:08,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {1556#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {1563#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:08,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#(and (<= 500 main_~p~0) (<= main_~k~0 1))} assume true; {1563#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:08,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {1563#(and (<= 500 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1524#false} is VALID [2018-11-14 18:59:08,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {1524#false} ~j~0 := ~j~0 + 1; {1524#false} is VALID [2018-11-14 18:59:08,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-14 18:59:08,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#false} assume !(~j~0 < ~p~0); {1524#false} is VALID [2018-11-14 18:59:08,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {1524#false} ~i~0 := ~i~0 + 1; {1524#false} is VALID [2018-11-14 18:59:08,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-14 18:59:08,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {1524#false} assume !(~i~0 < ~p~0); {1524#false} is VALID [2018-11-14 18:59:08,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {1524#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1524#false} is VALID [2018-11-14 18:59:08,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-14 18:59:08,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {1524#false} assume !(~i~0 < ~p~0); {1524#false} is VALID [2018-11-14 18:59:08,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {1524#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1524#false} is VALID [2018-11-14 18:59:08,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-14 18:59:08,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {1524#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1524#false} is VALID [2018-11-14 18:59:08,721 INFO L273 TraceCheckUtils]: 26: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-14 18:59:08,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {1524#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1524#false} is VALID [2018-11-14 18:59:08,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-14 18:59:08,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {1524#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {1524#false} is VALID [2018-11-14 18:59:08,722 INFO L256 TraceCheckUtils]: 30: Hoare triple {1524#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1524#false} is VALID [2018-11-14 18:59:08,722 INFO L273 TraceCheckUtils]: 31: Hoare triple {1524#false} ~cond := #in~cond; {1524#false} is VALID [2018-11-14 18:59:08,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {1524#false} assume ~cond == 0; {1524#false} is VALID [2018-11-14 18:59:08,723 INFO L273 TraceCheckUtils]: 33: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2018-11-14 18:59:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:08,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:08,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 18:59:08,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 18:59:08,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:08,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:59:08,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:08,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:59:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:59:08,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:08,799 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 5 states. [2018-11-14 18:59:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:09,242 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-11-14 18:59:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:59:09,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 18:59:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2018-11-14 18:59:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2018-11-14 18:59:09,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 136 transitions. [2018-11-14 18:59:09,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:09,518 INFO L225 Difference]: With dead ends: 119 [2018-11-14 18:59:09,518 INFO L226 Difference]: Without dead ends: 77 [2018-11-14 18:59:09,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-14 18:59:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-11-14 18:59:09,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:09,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 54 states. [2018-11-14 18:59:09,598 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 54 states. [2018-11-14 18:59:09,598 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 54 states. [2018-11-14 18:59:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:09,603 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-14 18:59:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-14 18:59:09,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:09,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:09,605 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 77 states. [2018-11-14 18:59:09,606 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 77 states. [2018-11-14 18:59:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:09,609 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-14 18:59:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-14 18:59:09,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:09,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:09,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:09,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 18:59:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-14 18:59:09,613 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 34 [2018-11-14 18:59:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:09,614 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-14 18:59:09,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:59:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 18:59:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:59:09,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:09,615 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:09,615 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:09,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1702704579, now seen corresponding path program 2 times [2018-11-14 18:59:09,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:09,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:09,624 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:09,624 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:09,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:09,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:09,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:59:09,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:09,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:09,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {2024#true} call ULTIMATE.init(); {2024#true} is VALID [2018-11-14 18:59:09,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {2024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2024#true} is VALID [2018-11-14 18:59:09,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {2024#true} assume true; {2024#true} is VALID [2018-11-14 18:59:09,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2024#true} {2024#true} #147#return; {2024#true} is VALID [2018-11-14 18:59:09,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {2024#true} call #t~ret5 := main(); {2024#true} is VALID [2018-11-14 18:59:09,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {2024#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {2044#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {2044#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {2044#(<= 500 main_~p~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {2044#(<= 500 main_~p~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {2044#(<= 500 main_~p~0)} assume !(~k~0 < ~p~0); {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {2044#(<= 500 main_~p~0)} ~j~0 := ~j~0 + 1; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {2044#(<= 500 main_~p~0)} assume !(~j~0 < ~p~0); {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {2044#(<= 500 main_~p~0)} ~i~0 := ~i~0 + 1; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {2044#(<= 500 main_~p~0)} assume !(~i~0 < ~p~0); {2044#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:09,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {2044#(<= 500 main_~p~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2096#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:09,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {2096#(and (<= 500 main_~p~0) (<= main_~i~0 0))} assume true; {2096#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:09,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {2096#(and (<= 500 main_~p~0) (<= main_~i~0 0))} assume !(~i~0 < ~p~0); {2025#false} is VALID [2018-11-14 18:59:09,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {2025#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2025#false} is VALID [2018-11-14 18:59:09,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {2025#false} assume true; {2025#false} is VALID [2018-11-14 18:59:09,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {2025#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2025#false} is VALID [2018-11-14 18:59:09,785 INFO L273 TraceCheckUtils]: 28: Hoare triple {2025#false} assume true; {2025#false} is VALID [2018-11-14 18:59:09,785 INFO L273 TraceCheckUtils]: 29: Hoare triple {2025#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2025#false} is VALID [2018-11-14 18:59:09,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {2025#false} assume true; {2025#false} is VALID [2018-11-14 18:59:09,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {2025#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {2025#false} is VALID [2018-11-14 18:59:09,786 INFO L256 TraceCheckUtils]: 32: Hoare triple {2025#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2025#false} is VALID [2018-11-14 18:59:09,787 INFO L273 TraceCheckUtils]: 33: Hoare triple {2025#false} ~cond := #in~cond; {2025#false} is VALID [2018-11-14 18:59:09,787 INFO L273 TraceCheckUtils]: 34: Hoare triple {2025#false} assume ~cond == 0; {2025#false} is VALID [2018-11-14 18:59:09,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {2025#false} assume !false; {2025#false} is VALID [2018-11-14 18:59:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:59:09,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:09,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:09,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 18:59:09,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:09,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:09,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:09,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:09,858 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 4 states. [2018-11-14 18:59:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:10,242 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2018-11-14 18:59:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:10,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 18:59:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 18:59:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 18:59:10,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2018-11-14 18:59:10,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:10,435 INFO L225 Difference]: With dead ends: 107 [2018-11-14 18:59:10,435 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 18:59:10,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 18:59:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2018-11-14 18:59:10,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:10,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 56 states. [2018-11-14 18:59:10,512 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 56 states. [2018-11-14 18:59:10,512 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 56 states. [2018-11-14 18:59:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:10,516 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-14 18:59:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-14 18:59:10,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:10,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:10,517 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 90 states. [2018-11-14 18:59:10,517 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 90 states. [2018-11-14 18:59:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:10,536 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-14 18:59:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-14 18:59:10,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:10,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:10,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:10,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:59:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-14 18:59:10,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 36 [2018-11-14 18:59:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:10,539 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-14 18:59:10,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-14 18:59:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 18:59:10,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:10,542 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:10,542 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:10,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 487964545, now seen corresponding path program 1 times [2018-11-14 18:59:10,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:10,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:10,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:10,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:10,562 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:10,562 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:10,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:10,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:10,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {2543#true} call ULTIMATE.init(); {2543#true} is VALID [2018-11-14 18:59:10,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {2543#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2543#true} is VALID [2018-11-14 18:59:10,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {2543#true} assume true; {2543#true} is VALID [2018-11-14 18:59:10,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2543#true} {2543#true} #147#return; {2543#true} is VALID [2018-11-14 18:59:10,746 INFO L256 TraceCheckUtils]: 4: Hoare triple {2543#true} call #t~ret5 := main(); {2543#true} is VALID [2018-11-14 18:59:10,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {2543#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2563#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:10,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2563#(<= 500 main_~p~0)} assume true; {2563#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:10,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {2563#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {2563#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:10,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {2563#(<= 500 main_~p~0)} assume true; {2563#(<= 500 main_~p~0)} is VALID [2018-11-14 18:59:10,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {2563#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {2576#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:10,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {2576#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume true; {2576#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:10,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {2576#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2583#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:10,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {2583#(and (<= 500 main_~p~0) (<= main_~k~0 1))} assume true; {2583#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:10,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {2583#(and (<= 500 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2590#(and (<= 500 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:59:10,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {2590#(and (<= 500 main_~p~0) (<= main_~k~0 2))} assume true; {2590#(and (<= 500 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:59:10,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {2590#(and (<= 500 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {2544#false} is VALID [2018-11-14 18:59:10,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {2544#false} ~j~0 := ~j~0 + 1; {2544#false} is VALID [2018-11-14 18:59:10,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {2544#false} assume !(~j~0 < ~p~0); {2544#false} is VALID [2018-11-14 18:59:10,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#false} ~i~0 := ~i~0 + 1; {2544#false} is VALID [2018-11-14 18:59:10,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {2544#false} assume !(~i~0 < ~p~0); {2544#false} is VALID [2018-11-14 18:59:10,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {2544#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2544#false} is VALID [2018-11-14 18:59:10,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {2544#false} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {2544#false} is VALID [2018-11-14 18:59:10,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {2544#false} assume !!(~j~0 < ~p~0);~k~0 := 0; {2544#false} is VALID [2018-11-14 18:59:10,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {2544#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;~k~0 := ~k~0 + 1; {2544#false} is VALID [2018-11-14 18:59:10,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {2544#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;~k~0 := ~k~0 + 1; {2544#false} is VALID [2018-11-14 18:59:10,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {2544#false} assume !(~k~0 < ~p~0); {2544#false} is VALID [2018-11-14 18:59:10,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {2544#false} ~j~0 := ~j~0 + 1; {2544#false} is VALID [2018-11-14 18:59:10,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {2544#false} assume !(~j~0 < ~p~0); {2544#false} is VALID [2018-11-14 18:59:10,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {2544#false} ~i~0 := ~i~0 + 1; {2544#false} is VALID [2018-11-14 18:59:10,760 INFO L273 TraceCheckUtils]: 37: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {2544#false} assume !(~i~0 < ~p~0); {2544#false} is VALID [2018-11-14 18:59:10,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {2544#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2544#false} is VALID [2018-11-14 18:59:10,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {2544#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2544#false} is VALID [2018-11-14 18:59:10,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {2544#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2544#false} is VALID [2018-11-14 18:59:10,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-14 18:59:10,762 INFO L273 TraceCheckUtils]: 45: Hoare triple {2544#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {2544#false} is VALID [2018-11-14 18:59:10,762 INFO L256 TraceCheckUtils]: 46: Hoare triple {2544#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2544#false} is VALID [2018-11-14 18:59:10,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {2544#false} ~cond := #in~cond; {2544#false} is VALID [2018-11-14 18:59:10,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {2544#false} assume ~cond == 0; {2544#false} is VALID [2018-11-14 18:59:10,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {2544#false} assume !false; {2544#false} is VALID [2018-11-14 18:59:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:59:10,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:10,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 18:59:10,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 18:59:10,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:10,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:59:10,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:10,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:59:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:59:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:10,879 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-11-14 18:59:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:11,449 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2018-11-14 18:59:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:59:11,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 18:59:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 18:59:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 18:59:11,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2018-11-14 18:59:11,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:11,624 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:59:11,624 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 18:59:11,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 18:59:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2018-11-14 18:59:11,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:11,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 60 states. [2018-11-14 18:59:11,917 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 60 states. [2018-11-14 18:59:11,917 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 60 states. [2018-11-14 18:59:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:11,920 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-14 18:59:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-11-14 18:59:11,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:11,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:11,921 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 90 states. [2018-11-14 18:59:11,921 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 90 states. [2018-11-14 18:59:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:11,924 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-14 18:59:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-11-14 18:59:11,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:11,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:11,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:11,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 18:59:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-14 18:59:11,926 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 50 [2018-11-14 18:59:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:11,927 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-14 18:59:11,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:59:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-14 18:59:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:59:11,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:11,928 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:11,928 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:11,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:11,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1369611969, now seen corresponding path program 2 times [2018-11-14 18:59:11,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:11,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:11,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:11,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:11,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:11,937 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:11,937 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:11,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:11,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:11,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:59:11,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:12,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:12,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-14 18:59:12,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 3 [2018-11-14 18:59:12,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:59:12,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:59:12,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:59:12,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:51, output treesize:3 [2018-11-14 18:59:12,162 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:59:12,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {3156#true} call ULTIMATE.init(); {3156#true} is VALID [2018-11-14 18:59:12,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {3156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3156#true} is VALID [2018-11-14 18:59:12,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3156#true} {3156#true} #147#return; {3156#true} is VALID [2018-11-14 18:59:12,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {3156#true} call #t~ret5 := main(); {3156#true} is VALID [2018-11-14 18:59:12,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {3156#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume (if ~p~0 < ~n~0 then 1 else 0) != 0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {3156#true} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {3156#true} assume !!(~j~0 < ~p~0);~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {3156#true} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {3156#true} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {3156#true} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {3156#true} assume !(~k~0 < ~p~0); {3156#true} is VALID [2018-11-14 18:59:12,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {3156#true} ~j~0 := ~j~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {3156#true} assume !(~j~0 < ~p~0); {3156#true} is VALID [2018-11-14 18:59:12,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {3156#true} ~i~0 := ~i~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,187 INFO L273 TraceCheckUtils]: 23: Hoare triple {3156#true} assume !(~i~0 < ~p~0); {3156#true} is VALID [2018-11-14 18:59:12,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {3156#true} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {3156#true} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,187 INFO L273 TraceCheckUtils]: 27: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {3156#true} assume !!(~j~0 < ~p~0);~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,188 INFO L273 TraceCheckUtils]: 29: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {3156#true} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;~k~0 := ~k~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {3156#true} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;~k~0 := ~k~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {3156#true} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;~k~0 := ~k~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {3156#true} assume !(~k~0 < ~p~0); {3156#true} is VALID [2018-11-14 18:59:12,189 INFO L273 TraceCheckUtils]: 37: Hoare triple {3156#true} ~j~0 := ~j~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {3156#true} assume !(~j~0 < ~p~0); {3156#true} is VALID [2018-11-14 18:59:12,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {3156#true} ~i~0 := ~i~0 + 1; {3156#true} is VALID [2018-11-14 18:59:12,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {3156#true} assume !(~i~0 < ~p~0); {3156#true} is VALID [2018-11-14 18:59:12,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {3156#true} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,191 INFO L273 TraceCheckUtils]: 44: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,191 INFO L273 TraceCheckUtils]: 45: Hoare triple {3156#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,192 INFO L273 TraceCheckUtils]: 46: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,192 INFO L273 TraceCheckUtils]: 47: Hoare triple {3156#true} assume !!(~j~0 < ~n~0);~k~0 := 0; {3156#true} is VALID [2018-11-14 18:59:12,192 INFO L273 TraceCheckUtils]: 48: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-14 18:59:12,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {3156#true} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {3308#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-14 18:59:12,227 INFO L256 TraceCheckUtils]: 50: Hoare triple {3308#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3312#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:59:12,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {3312#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3316#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 18:59:12,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {3316#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {3157#false} is VALID [2018-11-14 18:59:12,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {3157#false} assume !false; {3157#false} is VALID [2018-11-14 18:59:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 18:59:12,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:12,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:59:12,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-14 18:59:12,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:12,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:59:12,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:12,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:59:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:59:12,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:12,322 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 5 states. [2018-11-14 18:59:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:12,603 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 18:59:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:59:12,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-14 18:59:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-14 18:59:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-14 18:59:12,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2018-11-14 18:59:12,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:12,697 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:59:12,697 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:59:12,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:59:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:59:12,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:12,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:59:12,699 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:59:12,699 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:59:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:12,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:59:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:59:12,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:12,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:12,701 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:59:12,701 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:59:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:12,701 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:59:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:59:12,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:12,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:12,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:12,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:59:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:59:12,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-11-14 18:59:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:12,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:59:12,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:59:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:59:12,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:12,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:59:13,220 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:59:13,220 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:59:13,221 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 81) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point L52-1(lines 52 55) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L421 ceAbstractionStarter]: At program point L52-3(lines 52 55) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point L52-4(lines 52 55) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 70 77) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L421 ceAbstractionStarter]: At program point L70-3(lines 70 77) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point L70-4(lines 70 77) no Hoare annotation was computed. [2018-11-14 18:59:13,221 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 29 36) no Hoare annotation was computed. [2018-11-14 18:59:13,222 INFO L421 ceAbstractionStarter]: At program point L29-3(lines 29 36) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,222 INFO L425 ceAbstractionStarter]: For program point L29-4(lines 29 36) no Hoare annotation was computed. [2018-11-14 18:59:13,222 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 81) no Hoare annotation was computed. [2018-11-14 18:59:13,222 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 81) the Hoare annotation is: true [2018-11-14 18:59:13,222 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 59) no Hoare annotation was computed. [2018-11-14 18:59:13,222 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 59) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,222 INFO L425 ceAbstractionStarter]: For program point L47-4(lines 47 59) no Hoare annotation was computed. [2018-11-14 18:59:13,222 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 72 75) no Hoare annotation was computed. [2018-11-14 18:59:13,222 INFO L421 ceAbstractionStarter]: At program point L72-3(lines 72 75) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L72-4(lines 72 75) no Hoare annotation was computed. [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 34) no Hoare annotation was computed. [2018-11-14 18:59:13,223 INFO L421 ceAbstractionStarter]: At program point L31-3(lines 31 34) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L31-4(lines 31 34) no Hoare annotation was computed. [2018-11-14 18:59:13,223 INFO L421 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (and (<= 500 main_~p~0) (= |main_#t~mem4| |main_#t~mem3|)) [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L73-1(line 73) no Hoare annotation was computed. [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 50 57) no Hoare annotation was computed. [2018-11-14 18:59:13,223 INFO L421 ceAbstractionStarter]: At program point L50-3(lines 50 57) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L50-4(lines 50 57) no Hoare annotation was computed. [2018-11-14 18:59:13,223 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 67 79) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L421 ceAbstractionStarter]: At program point L67-3(lines 67 79) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point L67-4(lines 67 79) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 38) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L421 ceAbstractionStarter]: At program point L26-3(lines 26 38) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point L26-4(lines 26 38) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 18:59:13,224 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 18:59:13,226 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:59:13,227 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 18:59:13,228 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L67-4 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L72-4 has no Hoare annotation [2018-11-14 18:59:13,229 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L67-4 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-14 18:59:13,230 WARN L170 areAnnotationChecker]: L72-4 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L70-4 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-14 18:59:13,231 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2018-11-14 18:59:13,232 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2018-11-14 18:59:13,232 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2018-11-14 18:59:13,232 WARN L170 areAnnotationChecker]: L70-4 has no Hoare annotation [2018-11-14 18:59:13,232 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:59:13,232 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:59:13,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:59:13 BoogieIcfgContainer [2018-11-14 18:59:13,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:59:13,243 INFO L168 Benchmark]: Toolchain (without parser) took 11025.91 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -635.6 MB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:59:13,245 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:59:13,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:59:13,246 INFO L168 Benchmark]: Boogie Preprocessor took 79.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:59:13,247 INFO L168 Benchmark]: RCFGBuilder took 1128.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:59:13,248 INFO L168 Benchmark]: TraceAbstraction took 9478.05 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 126.4 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.4 MB). Peak memory consumption was 246.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:59:13,252 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1128.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9478.05 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 126.4 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.4 MB). Peak memory consumption was 246.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 500 <= p - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 9.3s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 306 SDtfs, 321 SDslu, 377 SDs, 0 SdLazy, 224 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 22 PreInvPairs, 42 NumberOfFragments, 39 HoareAnnotationTreeSize, 22 FomulaSimplifications, 4772 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 275 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 16391 SizeOfPredicates, 22 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 66/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...