java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:24:57,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:24:57,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:24:57,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:24:57,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:24:57,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:24:57,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:24:57,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:24:57,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:24:57,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:24:57,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:24:57,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:24:57,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:24:57,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:24:57,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:24:57,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:24:57,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:24:57,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:24:57,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:24:57,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:24:57,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:24:57,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:24:57,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:24:57,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:24:57,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:24:57,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:24:57,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:24:57,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:24:57,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:24:57,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:24:57,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:24:57,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:24:57,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:24:57,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:24:57,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:24:57,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:24:57,843 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:24:57,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:24:57,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:24:57,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:24:57,865 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:24:57,869 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:24:57,869 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:24:57,869 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:24:57,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:24:57,870 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:24:57,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:24:57,870 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:24:57,870 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:24:57,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:24:57,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:24:57,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:24:57,871 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:24:57,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:24:57,873 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:24:57,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:24:57,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:24:57,873 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:24:57,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:24:57,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:24:57,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:24:57,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:24:57,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:24:57,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:24:57,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:24:57,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:24:57,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:24:57,876 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:24:57,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:24:57,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:24:57,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:24:57,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:24:57,941 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:24:57,942 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-18 23:24:58,015 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0347801/1495c3d1e886400d9758f0383e54f95d/FLAGd36f00598 [2018-11-18 23:24:58,424 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:24:58,425 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i [2018-11-18 23:24:58,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0347801/1495c3d1e886400d9758f0383e54f95d/FLAGd36f00598 [2018-11-18 23:24:58,804 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0347801/1495c3d1e886400d9758f0383e54f95d [2018-11-18 23:24:58,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:24:58,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:24:58,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:24:58,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:24:58,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:24:58,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:24:58" (1/1) ... [2018-11-18 23:24:58,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a4398c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:58, skipping insertion in model container [2018-11-18 23:24:58,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:24:58" (1/1) ... [2018-11-18 23:24:58,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:24:58,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:24:59,152 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:24:59,157 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:24:59,194 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:24:59,219 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:24:59,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59 WrapperNode [2018-11-18 23:24:59,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:24:59,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:24:59,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:24:59,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:24:59,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... [2018-11-18 23:24:59,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:24:59,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:24:59,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:24:59,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:24:59,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:24:59,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:24:59,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:24:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:24:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:24:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:24:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 23:24:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:24:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:24:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:24:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:24:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:24:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:24:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:24:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:24:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:24:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:25:00,360 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:25:00,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:00 BoogieIcfgContainer [2018-11-18 23:25:00,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:25:00,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:25:00,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:25:00,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:25:00,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:24:58" (1/3) ... [2018-11-18 23:25:00,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336e6797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:00, skipping insertion in model container [2018-11-18 23:25:00,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:59" (2/3) ... [2018-11-18 23:25:00,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336e6797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:00, skipping insertion in model container [2018-11-18 23:25:00,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:00" (3/3) ... [2018-11-18 23:25:00,372 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u_true-unreach-call.i [2018-11-18 23:25:00,381 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:25:00,388 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:25:00,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:25:00,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:25:00,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:25:00,437 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:25:00,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:25:00,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:25:00,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:25:00,438 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:25:00,438 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:25:00,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:25:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-18 23:25:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:25:00,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:00,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:00,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:00,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1945566331, now seen corresponding path program 1 times [2018-11-18 23:25:00,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:00,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:00,563 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:00,563 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:00,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:00,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:00,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:00,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-18 23:25:00,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-18 23:25:00,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-18 23:25:00,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-18 23:25:00,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2018-11-18 23:25:00,726 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {48#true} is VALID [2018-11-18 23:25:00,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-18 23:25:00,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-18 23:25:00,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-18 23:25:00,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-18 23:25:00,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-18 23:25:00,729 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-18 23:25:00,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-18 23:25:00,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {49#false} is VALID [2018-11-18 23:25:00,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-18 23:25:00,730 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {49#false} is VALID [2018-11-18 23:25:00,730 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-18 23:25:00,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-18 23:25:00,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume 0 == ~cond; {49#false} is VALID [2018-11-18 23:25:00,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-18 23:25:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:00,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:25:00,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 23:25:00,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:00,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:25:00,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:00,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:25:00,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:25:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:25:00,853 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-18 23:25:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:01,056 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2018-11-18 23:25:01,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:25:01,056 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 23:25:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:25:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-18 23:25:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:25:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-18 23:25:01,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-18 23:25:01,801 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-18 23:25:01,816 INFO L225 Difference]: With dead ends: 84 [2018-11-18 23:25:01,817 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 23:25:01,820 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-18 23:25:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 23:25:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-18 23:25:01,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:01,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-18 23:25:01,879 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-18 23:25:01,879 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-18 23:25:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:01,884 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-18 23:25:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-18 23:25:01,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:01,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:01,886 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-18 23:25:01,886 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-18 23:25:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:01,891 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-18 23:25:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-18 23:25:01,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:01,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:01,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:01,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 23:25:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-18 23:25:01,898 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2018-11-18 23:25:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:01,898 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-18 23:25:01,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:25:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-18 23:25:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 23:25:01,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:01,903 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-18 23:25:01,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:01,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1304843137, now seen corresponding path program 1 times [2018-11-18 23:25:01,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:01,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:01,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:01,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:01,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:01,913 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:01,914 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:01,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:01,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:01,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:02,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2018-11-18 23:25:02,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {354#true} is VALID [2018-11-18 23:25:02,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2018-11-18 23:25:02,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #147#return; {354#true} is VALID [2018-11-18 23:25:02,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret5 := main(); {354#true} is VALID [2018-11-18 23:25:02,328 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {374#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:25:02,329 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-18 23:25:02,330 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-18 23:25:02,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-18 23:25:02,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-18 23:25:02,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {355#false} assume !(~i~0 < ~p~0); {355#false} is VALID [2018-11-18 23:25:02,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-18 23:25:02,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-18 23:25:02,333 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-18 23:25:02,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-18 23:25:02,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {355#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {355#false} is VALID [2018-11-18 23:25:02,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-18 23:25:02,334 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {355#false} is VALID [2018-11-18 23:25:02,334 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-18 23:25:02,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {355#false} ~cond := #in~cond; {355#false} is VALID [2018-11-18 23:25:02,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {355#false} assume 0 == ~cond; {355#false} is VALID [2018-11-18 23:25:02,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {355#false} assume !false; {355#false} is VALID [2018-11-18 23:25:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:02,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:02,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:25:02,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:25:02,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:02,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:25:02,522 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-18 23:25:02,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:25:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:25:02,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:25:02,522 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-18 23:25:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:02,831 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-18 23:25:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:25:02,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:25:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:25:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-18 23:25:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:25:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-18 23:25:02,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-18 23:25:03,076 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-18 23:25:03,079 INFO L225 Difference]: With dead ends: 74 [2018-11-18 23:25:03,079 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 23:25:03,080 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-18 23:25:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 23:25:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-18 23:25:03,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:03,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2018-11-18 23:25:03,101 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2018-11-18 23:25:03,101 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2018-11-18 23:25:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,104 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-18 23:25:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 23:25:03,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:03,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:03,106 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2018-11-18 23:25:03,106 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2018-11-18 23:25:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,115 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-18 23:25:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 23:25:03,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:03,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:03,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:03,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 23:25:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-18 23:25:03,121 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2018-11-18 23:25:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:03,121 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 23:25:03,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:25:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-18 23:25:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 23:25:03,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:03,123 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-18 23:25:03,124 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:03,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash -272598018, now seen corresponding path program 1 times [2018-11-18 23:25:03,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:03,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:03,135 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:03,135 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:03,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:03,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:03,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:03,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-18 23:25:03,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-18 23:25:03,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-18 23:25:03,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #147#return; {676#true} is VALID [2018-11-18 23:25:03,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret5 := main(); {676#true} is VALID [2018-11-18 23:25:03,305 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {696#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:03,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= 500 main_~p~0)} assume true; {696#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:03,307 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-18 23:25:03,309 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-18 23:25:03,314 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-18 23:25:03,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#false} ~i~0 := 1 + ~i~0; {677#false} is VALID [2018-11-18 23:25:03,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-18 23:25:03,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#false} assume !(~i~0 < ~p~0); {677#false} is VALID [2018-11-18 23:25:03,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-18 23:25:03,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-18 23:25:03,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {677#false} assume !(~i~0 < ~p~0); {677#false} is VALID [2018-11-18 23:25:03,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-18 23:25:03,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-18 23:25:03,316 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-18 23:25:03,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-18 23:25:03,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {677#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {677#false} is VALID [2018-11-18 23:25:03,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-18 23:25:03,317 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {677#false} is VALID [2018-11-18 23:25:03,318 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-18 23:25:03,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {677#false} ~cond := #in~cond; {677#false} is VALID [2018-11-18 23:25:03,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {677#false} assume 0 == ~cond; {677#false} is VALID [2018-11-18 23:25:03,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-18 23:25:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:03,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:03,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:25:03,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 23:25:03,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:03,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:03,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:03,385 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 4 states. [2018-11-18 23:25:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,723 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2018-11-18 23:25:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:03,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 23:25:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2018-11-18 23:25:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2018-11-18 23:25:03,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2018-11-18 23:25:03,901 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-18 23:25:03,905 INFO L225 Difference]: With dead ends: 99 [2018-11-18 23:25:03,905 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 23:25:03,906 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-18 23:25:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 23:25:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-11-18 23:25:03,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:03,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 46 states. [2018-11-18 23:25:03,961 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 46 states. [2018-11-18 23:25:03,961 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 46 states. [2018-11-18 23:25:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,966 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-18 23:25:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-18 23:25:03,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:03,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:03,968 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 65 states. [2018-11-18 23:25:03,968 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 65 states. [2018-11-18 23:25:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,972 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-18 23:25:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-18 23:25:03,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:03,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:03,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:03,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 23:25:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 23:25:03,976 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 27 [2018-11-18 23:25:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:03,976 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 23:25:03,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 23:25:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:25:03,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:03,978 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-18 23:25:03,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:03,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1346161551, now seen corresponding path program 1 times [2018-11-18 23:25:03,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:03,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:03,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:03,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:03,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:03,986 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:03,986 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:03,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:03,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:04,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:04,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {1089#true} call ULTIMATE.init(); {1089#true} is VALID [2018-11-18 23:25:04,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {1089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1089#true} is VALID [2018-11-18 23:25:04,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {1089#true} assume true; {1089#true} is VALID [2018-11-18 23:25:04,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} #147#return; {1089#true} is VALID [2018-11-18 23:25:04,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {1089#true} call #t~ret5 := main(); {1089#true} is VALID [2018-11-18 23:25:04,357 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1109#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:04,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {1109#(<= 500 main_~p~0)} assume true; {1109#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:04,358 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-18 23:25:04,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(<= 500 main_~p~0)} assume true; {1109#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:04,359 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-18 23:25:04,360 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-18 23:25:04,361 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-18 23:25:04,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#false} ~j~0 := 1 + ~j~0; {1090#false} is VALID [2018-11-18 23:25:04,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-18 23:25:04,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#false} assume !(~j~0 < ~p~0); {1090#false} is VALID [2018-11-18 23:25:04,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#false} ~i~0 := 1 + ~i~0; {1090#false} is VALID [2018-11-18 23:25:04,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-18 23:25:04,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {1090#false} assume !(~i~0 < ~p~0); {1090#false} is VALID [2018-11-18 23:25:04,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-18 23:25:04,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-18 23:25:04,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#false} assume !(~i~0 < ~p~0); {1090#false} is VALID [2018-11-18 23:25:04,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-18 23:25:04,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-18 23:25:04,365 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-18 23:25:04,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-18 23:25:04,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {1090#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1090#false} is VALID [2018-11-18 23:25:04,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-18 23:25:04,365 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1090#false} is VALID [2018-11-18 23:25:04,366 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-18 23:25:04,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {1090#false} ~cond := #in~cond; {1090#false} is VALID [2018-11-18 23:25:04,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {1090#false} assume 0 == ~cond; {1090#false} is VALID [2018-11-18 23:25:04,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2018-11-18 23:25:04,368 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-18 23:25:04,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:04,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:25:04,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-18 23:25:04,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:04,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:04,426 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-18 23:25:04,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:04,427 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 4 states. [2018-11-18 23:25:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:04,674 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-18 23:25:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:04,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-18 23:25:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-18 23:25:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-18 23:25:04,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-18 23:25:04,883 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-18 23:25:04,886 INFO L225 Difference]: With dead ends: 101 [2018-11-18 23:25:04,886 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 23:25:04,887 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-18 23:25:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 23:25:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2018-11-18 23:25:04,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:04,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 50 states. [2018-11-18 23:25:04,932 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 50 states. [2018-11-18 23:25:04,932 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 50 states. [2018-11-18 23:25:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:04,936 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-18 23:25:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-18 23:25:04,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:04,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:04,937 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 63 states. [2018-11-18 23:25:04,937 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 63 states. [2018-11-18 23:25:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:04,941 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-18 23:25:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-18 23:25:04,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:04,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:04,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:04,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 23:25:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-18 23:25:04,945 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 32 [2018-11-18 23:25:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:04,945 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-18 23:25:04,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-18 23:25:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 23:25:04,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:04,947 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-18 23:25:04,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:04,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1109010455, now seen corresponding path program 1 times [2018-11-18 23:25:04,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:04,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:04,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:04,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:04,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:04,955 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:04,955 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:04,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:04,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:05,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:05,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2018-11-18 23:25:05,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {1523#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1523#true} is VALID [2018-11-18 23:25:05,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-18 23:25:05,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #147#return; {1523#true} is VALID [2018-11-18 23:25:05,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret5 := main(); {1523#true} is VALID [2018-11-18 23:25:05,248 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1543#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:05,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {1543#(<= 500 main_~p~0)} assume true; {1543#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:05,252 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-18 23:25:05,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {1543#(<= 500 main_~p~0)} assume true; {1543#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:05,255 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-18 23:25:05,256 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-18 23:25:05,261 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1563#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-18 23:25:05,264 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-18 23:25:05,266 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-18 23:25:05,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {1524#false} ~j~0 := 1 + ~j~0; {1524#false} is VALID [2018-11-18 23:25:05,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 23:25:05,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#false} assume !(~j~0 < ~p~0); {1524#false} is VALID [2018-11-18 23:25:05,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {1524#false} ~i~0 := 1 + ~i~0; {1524#false} is VALID [2018-11-18 23:25:05,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 23:25:05,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {1524#false} assume !(~i~0 < ~p~0); {1524#false} is VALID [2018-11-18 23:25:05,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {1524#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1524#false} is VALID [2018-11-18 23:25:05,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 23:25:05,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {1524#false} assume !(~i~0 < ~p~0); {1524#false} is VALID [2018-11-18 23:25:05,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {1524#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1524#false} is VALID [2018-11-18 23:25:05,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 23:25:05,269 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-18 23:25:05,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 23:25:05,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {1524#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1524#false} is VALID [2018-11-18 23:25:05,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {1524#false} assume true; {1524#false} is VALID [2018-11-18 23:25:05,270 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1524#false} is VALID [2018-11-18 23:25:05,270 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-18 23:25:05,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {1524#false} ~cond := #in~cond; {1524#false} is VALID [2018-11-18 23:25:05,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {1524#false} assume 0 == ~cond; {1524#false} is VALID [2018-11-18 23:25:05,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2018-11-18 23:25:05,274 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-18 23:25:05,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:05,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:25:05,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 23:25:05,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:05,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:25:05,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:05,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:25:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:25:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:05,376 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 5 states. [2018-11-18 23:25:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:05,854 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-11-18 23:25:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:25:05,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 23:25:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2018-11-18 23:25:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2018-11-18 23:25:05,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 136 transitions. [2018-11-18 23:25:06,120 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-18 23:25:06,123 INFO L225 Difference]: With dead ends: 119 [2018-11-18 23:25:06,123 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 23:25:06,124 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-18 23:25:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 23:25:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-11-18 23:25:06,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:06,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 54 states. [2018-11-18 23:25:06,232 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 54 states. [2018-11-18 23:25:06,232 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 54 states. [2018-11-18 23:25:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:06,237 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-18 23:25:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-18 23:25:06,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 77 states. [2018-11-18 23:25:06,239 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 77 states. [2018-11-18 23:25:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:06,242 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-18 23:25:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-18 23:25:06,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:06,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:06,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:06,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:25:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-18 23:25:06,246 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 34 [2018-11-18 23:25:06,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:06,246 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-18 23:25:06,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:25:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-18 23:25:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 23:25:06,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:06,248 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-18 23:25:06,248 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:06,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1702704579, now seen corresponding path program 2 times [2018-11-18 23:25:06,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:06,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:06,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:06,255 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:06,256 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:06,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:25:06,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:25:06,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:06,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:06,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {2024#true} call ULTIMATE.init(); {2024#true} is VALID [2018-11-18 23:25:06,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {2024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2024#true} is VALID [2018-11-18 23:25:06,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {2024#true} assume true; {2024#true} is VALID [2018-11-18 23:25:06,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2024#true} {2024#true} #147#return; {2024#true} is VALID [2018-11-18 23:25:06,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {2024#true} call #t~ret5 := main(); {2024#true} is VALID [2018-11-18 23:25:06,413 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,414 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-18 23:25:06,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,415 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-18 23:25:06,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,417 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,421 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,423 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-18 23:25:06,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {2044#(<= 500 main_~p~0)} ~j~0 := 1 + ~j~0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,428 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-18 23:25:06,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {2044#(<= 500 main_~p~0)} ~i~0 := 1 + ~i~0; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {2044#(<= 500 main_~p~0)} assume true; {2044#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:06,430 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-18 23:25:06,430 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-18 23:25:06,432 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-18 23:25:06,433 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-18 23:25:06,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {2025#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2025#false} is VALID [2018-11-18 23:25:06,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {2025#false} assume true; {2025#false} is VALID [2018-11-18 23:25:06,434 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-18 23:25:06,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {2025#false} assume true; {2025#false} is VALID [2018-11-18 23:25:06,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {2025#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2025#false} is VALID [2018-11-18 23:25:06,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {2025#false} assume true; {2025#false} is VALID [2018-11-18 23:25:06,435 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2025#false} is VALID [2018-11-18 23:25:06,436 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-18 23:25:06,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {2025#false} ~cond := #in~cond; {2025#false} is VALID [2018-11-18 23:25:06,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {2025#false} assume 0 == ~cond; {2025#false} is VALID [2018-11-18 23:25:06,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {2025#false} assume !false; {2025#false} is VALID [2018-11-18 23:25:06,440 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-18 23:25:06,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:06,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:25:06,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 23:25:06,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:06,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:06,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:06,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:06,505 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 4 states. [2018-11-18 23:25:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:06,857 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2018-11-18 23:25:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:06,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 23:25:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-18 23:25:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-18 23:25:06,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2018-11-18 23:25:07,057 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-18 23:25:07,060 INFO L225 Difference]: With dead ends: 107 [2018-11-18 23:25:07,060 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 23:25:07,061 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-18 23:25:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 23:25:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2018-11-18 23:25:07,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:07,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 56 states. [2018-11-18 23:25:07,178 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 56 states. [2018-11-18 23:25:07,178 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 56 states. [2018-11-18 23:25:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:07,182 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-18 23:25:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-18 23:25:07,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:07,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:07,183 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 90 states. [2018-11-18 23:25:07,183 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 90 states. [2018-11-18 23:25:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:07,187 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-18 23:25:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-18 23:25:07,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:07,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:07,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:07,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 23:25:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-18 23:25:07,191 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 36 [2018-11-18 23:25:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:07,191 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-18 23:25:07,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-18 23:25:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 23:25:07,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:07,193 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-18 23:25:07,193 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:07,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash 487964545, now seen corresponding path program 1 times [2018-11-18 23:25:07,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:07,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:07,202 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:07,202 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:07,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:07,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:07,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:08,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {2543#true} call ULTIMATE.init(); {2543#true} is VALID [2018-11-18 23:25:08,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {2543#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2543#true} is VALID [2018-11-18 23:25:08,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {2543#true} assume true; {2543#true} is VALID [2018-11-18 23:25:08,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2543#true} {2543#true} #147#return; {2543#true} is VALID [2018-11-18 23:25:08,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {2543#true} call #t~ret5 := main(); {2543#true} is VALID [2018-11-18 23:25:08,079 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2563#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:08,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {2563#(<= 500 main_~p~0)} assume true; {2563#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:08,080 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-18 23:25:08,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {2563#(<= 500 main_~p~0)} assume true; {2563#(<= 500 main_~p~0)} is VALID [2018-11-18 23:25:08,081 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-18 23:25:08,081 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-18 23:25:08,082 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2583#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-18 23:25:08,083 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-18 23:25:08,084 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2590#(and (<= 500 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-18 23:25:08,085 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-18 23:25:08,086 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-18 23:25:08,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {2544#false} ~j~0 := 1 + ~j~0; {2544#false} is VALID [2018-11-18 23:25:08,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {2544#false} assume !(~j~0 < ~p~0); {2544#false} is VALID [2018-11-18 23:25:08,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#false} ~i~0 := 1 + ~i~0; {2544#false} is VALID [2018-11-18 23:25:08,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {2544#false} assume !(~i~0 < ~p~0); {2544#false} is VALID [2018-11-18 23:25:08,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {2544#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2544#false} is VALID [2018-11-18 23:25:08,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,089 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-18 23:25:08,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {2544#false} assume !!(~j~0 < ~p~0);~k~0 := 0; {2544#false} is VALID [2018-11-18 23:25:08,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,090 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {2544#false} is VALID [2018-11-18 23:25:08,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,091 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {2544#false} is VALID [2018-11-18 23:25:08,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {2544#false} assume !(~k~0 < ~p~0); {2544#false} is VALID [2018-11-18 23:25:08,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {2544#false} ~j~0 := 1 + ~j~0; {2544#false} is VALID [2018-11-18 23:25:08,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {2544#false} assume !(~j~0 < ~p~0); {2544#false} is VALID [2018-11-18 23:25:08,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {2544#false} ~i~0 := 1 + ~i~0; {2544#false} is VALID [2018-11-18 23:25:08,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {2544#false} assume !(~i~0 < ~p~0); {2544#false} is VALID [2018-11-18 23:25:08,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {2544#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2544#false} is VALID [2018-11-18 23:25:08,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,093 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-18 23:25:08,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,094 INFO L273 TraceCheckUtils]: 43: Hoare triple {2544#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2544#false} is VALID [2018-11-18 23:25:08,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {2544#false} assume true; {2544#false} is VALID [2018-11-18 23:25:08,094 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2544#false} is VALID [2018-11-18 23:25:08,094 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-18 23:25:08,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {2544#false} ~cond := #in~cond; {2544#false} is VALID [2018-11-18 23:25:08,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {2544#false} assume 0 == ~cond; {2544#false} is VALID [2018-11-18 23:25:08,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {2544#false} assume !false; {2544#false} is VALID [2018-11-18 23:25:08,098 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-18 23:25:08,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:08,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:25:08,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 23:25:08,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:08,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:25:08,230 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-18 23:25:08,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:25:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:25:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:25:08,231 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-11-18 23:25:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:08,772 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2018-11-18 23:25:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:25:08,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 23:25:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-18 23:25:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-18 23:25:08,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2018-11-18 23:25:08,937 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-18 23:25:08,939 INFO L225 Difference]: With dead ends: 138 [2018-11-18 23:25:08,940 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 23:25:08,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:25:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 23:25:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2018-11-18 23:25:09,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:09,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 60 states. [2018-11-18 23:25:09,181 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 60 states. [2018-11-18 23:25:09,181 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 60 states. [2018-11-18 23:25:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:09,184 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-18 23:25:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-11-18 23:25:09,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:09,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:09,185 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 90 states. [2018-11-18 23:25:09,185 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 90 states. [2018-11-18 23:25:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:09,188 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-18 23:25:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-11-18 23:25:09,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:09,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:09,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:09,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 23:25:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-18 23:25:09,191 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 50 [2018-11-18 23:25:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:09,191 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-18 23:25:09,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:25:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-18 23:25:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 23:25:09,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:09,192 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-18 23:25:09,192 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:09,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1369611969, now seen corresponding path program 2 times [2018-11-18 23:25:09,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:09,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:09,199 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:09,200 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:09,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:09,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:25:09,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:25:09,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:09,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:09,437 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-18 23:25:09,502 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-18 23:25:09,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:25:09,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:25:09,602 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-18 23:25:09,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:51, output treesize:3 [2018-11-18 23:25:09,616 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:25:09,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {3156#true} call ULTIMATE.init(); {3156#true} is VALID [2018-11-18 23:25:09,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {3156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3156#true} is VALID [2018-11-18 23:25:09,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3156#true} {3156#true} #147#return; {3156#true} is VALID [2018-11-18 23:25:09,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {3156#true} call #t~ret5 := main(); {3156#true} is VALID [2018-11-18 23:25:09,692 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(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-18 23:25:09,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,692 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-18 23:25:09,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {3156#true} assume !!(~j~0 < ~p~0);~k~0 := 0; {3156#true} is VALID [2018-11-18 23:25:09,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,693 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3156#true} is VALID [2018-11-18 23:25:09,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,694 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3156#true} is VALID [2018-11-18 23:25:09,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,694 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3156#true} is VALID [2018-11-18 23:25:09,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {3156#true} assume !(~k~0 < ~p~0); {3156#true} is VALID [2018-11-18 23:25:09,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {3156#true} ~j~0 := 1 + ~j~0; {3156#true} is VALID [2018-11-18 23:25:09,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {3156#true} assume !(~j~0 < ~p~0); {3156#true} is VALID [2018-11-18 23:25:09,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {3156#true} ~i~0 := 1 + ~i~0; {3156#true} is VALID [2018-11-18 23:25:09,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,696 INFO L273 TraceCheckUtils]: 23: Hoare triple {3156#true} assume !(~i~0 < ~p~0); {3156#true} is VALID [2018-11-18 23:25:09,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {3156#true} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-18 23:25:09,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,696 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-18 23:25:09,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {3156#true} assume !!(~j~0 < ~p~0);~k~0 := 0; {3156#true} is VALID [2018-11-18 23:25:09,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,697 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {3156#true} is VALID [2018-11-18 23:25:09,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,698 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {3156#true} is VALID [2018-11-18 23:25:09,698 INFO L273 TraceCheckUtils]: 33: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,698 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {3156#true} is VALID [2018-11-18 23:25:09,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {3156#true} assume !(~k~0 < ~p~0); {3156#true} is VALID [2018-11-18 23:25:09,699 INFO L273 TraceCheckUtils]: 37: Hoare triple {3156#true} ~j~0 := 1 + ~j~0; {3156#true} is VALID [2018-11-18 23:25:09,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,700 INFO L273 TraceCheckUtils]: 39: Hoare triple {3156#true} assume !(~j~0 < ~p~0); {3156#true} is VALID [2018-11-18 23:25:09,700 INFO L273 TraceCheckUtils]: 40: Hoare triple {3156#true} ~i~0 := 1 + ~i~0; {3156#true} is VALID [2018-11-18 23:25:09,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,700 INFO L273 TraceCheckUtils]: 42: Hoare triple {3156#true} assume !(~i~0 < ~p~0); {3156#true} is VALID [2018-11-18 23:25:09,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {3156#true} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3156#true} is VALID [2018-11-18 23:25:09,701 INFO L273 TraceCheckUtils]: 44: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,701 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-18 23:25:09,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {3156#true} assume !!(~j~0 < ~n~0);~k~0 := 0; {3156#true} is VALID [2018-11-18 23:25:09,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {3156#true} assume true; {3156#true} is VALID [2018-11-18 23:25:09,708 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {3308#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-18 23:25:09,713 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-18 23:25:09,713 INFO L273 TraceCheckUtils]: 51: Hoare triple {3312#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3316#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:25:09,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {3316#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3157#false} is VALID [2018-11-18 23:25:09,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {3157#false} assume !false; {3157#false} is VALID [2018-11-18 23:25:09,721 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-18 23:25:09,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:09,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:25:09,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 23:25:09,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:09,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:25:09,776 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-18 23:25:09,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:25:09,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:25:09,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:09,777 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 5 states. [2018-11-18 23:25:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:10,023 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-18 23:25:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:25:10,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 23:25:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-18 23:25:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-18 23:25:10,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2018-11-18 23:25:10,114 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-18 23:25:10,114 INFO L225 Difference]: With dead ends: 60 [2018-11-18 23:25:10,115 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:25:10,116 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-18 23:25:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:25:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:25:10,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:10,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:25:10,117 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:25:10,117 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:25:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:10,117 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:25:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:25:10,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:10,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:10,118 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:25:10,118 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:25:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:10,118 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:25:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:25:10,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:10,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:10,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:10,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:25:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:25:10,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-11-18 23:25:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:10,120 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:25:10,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:25:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:25:10,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:10,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:25:10,397 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:25:10,398 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:25:10,398 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:25:10,398 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:25:10,398 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:25:10,398 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:25:10,398 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:25:10,398 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 81) no Hoare annotation was computed. [2018-11-18 23:25:10,399 INFO L425 ceAbstractionStarter]: For program point L52-1(lines 52 55) no Hoare annotation was computed. [2018-11-18 23:25:10,399 INFO L421 ceAbstractionStarter]: At program point L52-3(lines 52 55) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,399 INFO L425 ceAbstractionStarter]: For program point L52-4(lines 52 55) no Hoare annotation was computed. [2018-11-18 23:25:10,399 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 70 77) no Hoare annotation was computed. [2018-11-18 23:25:10,399 INFO L421 ceAbstractionStarter]: At program point L70-3(lines 70 77) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,399 INFO L425 ceAbstractionStarter]: For program point L70-4(lines 70 77) no Hoare annotation was computed. [2018-11-18 23:25:10,399 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 29 36) no Hoare annotation was computed. [2018-11-18 23:25:10,399 INFO L421 ceAbstractionStarter]: At program point L29-3(lines 29 36) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,399 INFO L425 ceAbstractionStarter]: For program point L29-4(lines 29 36) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 81) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 81) the Hoare annotation is: true [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 59) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 59) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point L47-4(lines 47 59) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 72 75) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L421 ceAbstractionStarter]: At program point L72-3(lines 72 75) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point L72-4(lines 72 75) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 34) no Hoare annotation was computed. [2018-11-18 23:25:10,400 INFO L421 ceAbstractionStarter]: At program point L31-3(lines 31 34) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,400 INFO L425 ceAbstractionStarter]: For program point L31-4(lines 31 34) no Hoare annotation was computed. [2018-11-18 23:25:10,400 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-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L73-1(line 73) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 50 57) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L421 ceAbstractionStarter]: At program point L50-3(lines 50 57) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L50-4(lines 50 57) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 67 79) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L421 ceAbstractionStarter]: At program point L67-3(lines 67 79) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L67-4(lines 67 79) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 38) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L421 ceAbstractionStarter]: At program point L26-3(lines 26 38) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point L26-4(lines 26 38) no Hoare annotation was computed. [2018-11-18 23:25:10,401 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 23:25:10,401 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:25:10,402 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 23:25:10,402 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 23:25:10,402 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 23:25:10,402 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:25:10,403 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:25:10,404 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:25:10,404 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 23:25:10,405 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2018-11-18 23:25:10,406 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L67-4 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L72-4 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-18 23:25:10,407 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L67-4 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L72-4 has no Hoare annotation [2018-11-18 23:25:10,408 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L70-4 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2018-11-18 23:25:10,409 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2018-11-18 23:25:10,410 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2018-11-18 23:25:10,410 WARN L170 areAnnotationChecker]: L70-4 has no Hoare annotation [2018-11-18 23:25:10,410 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:25:10,410 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-18 23:25:10,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:25:10 BoogieIcfgContainer [2018-11-18 23:25:10,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:25:10,423 INFO L168 Benchmark]: Toolchain (without parser) took 11609.22 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 855.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -638.9 MB). Peak memory consumption was 216.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:25:10,425 INFO L168 Benchmark]: CDTParser took 0.21 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-18 23:25:10,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:25:10,426 INFO L168 Benchmark]: Boogie Preprocessor took 60.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:25:10,426 INFO L168 Benchmark]: RCFGBuilder took 1079.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:25:10,427 INFO L168 Benchmark]: TraceAbstraction took 10058.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.9 MB). Peak memory consumption was 243.5 MB. Max. memory is 7.1 GB. [2018-11-18 23:25:10,432 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.21 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 404.30 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 60.96 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 1079.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10058.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.9 MB). Peak memory consumption was 243.5 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.9s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 306 SDtfs, 321 SDslu, 377 SDs, 0 SdLazy, 224 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s 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.7s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s 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...