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/loops/lu.cmp_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:58:27,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:58:27,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:58:27,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:58:27,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:58:27,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:58:27,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:58:27,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:58:27,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:58:27,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:58:27,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:58:27,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:58:27,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:58:27,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:58:27,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:58:27,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:58:27,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:58:27,869 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:58:27,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:58:27,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:58:27,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:58:27,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:58:27,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:58:27,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:58:27,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:58:27,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:58:27,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:58:27,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:58:27,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:58:27,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:58:27,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:58:27,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:58:27,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:58:27,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:58:27,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:58:27,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:58:27,904 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:58:27,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:58:27,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:58:27,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:58:27,925 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:58:27,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:58:27,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:58:27,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:58:27,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:58:27,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:58:27,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:58:27,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:58:27,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:58:27,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:58:27,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:58:27,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:58:27,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:58:27,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:58:27,928 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:58:27,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:58:27,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:58:27,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:58:27,929 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:58:27,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:58:27,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:58:27,930 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:58:27,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:58:27,930 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:58:27,930 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:58:27,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:58:27,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:58:27,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:58:27,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:58:28,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:58:28,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:58:28,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:58:28,008 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:58:28,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp_true-unreach-call.i [2018-11-18 23:58:28,085 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38183497/a2ffc90dc4c94074b781e7185fc8d104/FLAG7b42995eb [2018-11-18 23:58:28,555 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:58:28,556 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp_true-unreach-call.i [2018-11-18 23:58:28,573 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38183497/a2ffc90dc4c94074b781e7185fc8d104/FLAG7b42995eb [2018-11-18 23:58:28,899 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38183497/a2ffc90dc4c94074b781e7185fc8d104 [2018-11-18 23:58:28,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:58:28,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:58:28,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:58:28,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:58:28,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:58:28,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:28" (1/1) ... [2018-11-18 23:58:28,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ede2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:28, skipping insertion in model container [2018-11-18 23:58:28,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:28" (1/1) ... [2018-11-18 23:58:28,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:58:28,966 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:58:29,263 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:58:29,270 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:58:29,328 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:58:29,350 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:58:29,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29 WrapperNode [2018-11-18 23:58:29,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:58:29,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:58:29,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:58:29,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:58:29,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (1/1) ... [2018-11-18 23:58:29,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:58:29,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:58:29,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:58:29,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:58:29,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (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:58:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:58:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:58:29,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:58:29,604 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2018-11-18 23:58:29,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:58:29,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2018-11-18 23:58:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:58:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:58:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2018-11-18 23:58:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2018-11-18 23:58:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:58:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-18 23:58:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-18 23:58:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:58:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:58:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:58:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:58:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-11-18 23:58:30,990 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:58:30,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:30 BoogieIcfgContainer [2018-11-18 23:58:30,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:58:30,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:58:30,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:58:30,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:58:30,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:58:28" (1/3) ... [2018-11-18 23:58:30,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23764897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:30, skipping insertion in model container [2018-11-18 23:58:30,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:29" (2/3) ... [2018-11-18 23:58:30,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23764897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:30, skipping insertion in model container [2018-11-18 23:58:30,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:30" (3/3) ... [2018-11-18 23:58:30,999 INFO L112 eAbstractionObserver]: Analyzing ICFG lu.cmp_true-unreach-call.i [2018-11-18 23:58:31,007 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:58:31,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:58:31,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:58:31,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:58:31,066 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:58:31,067 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:58:31,067 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:58:31,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:58:31,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:58:31,068 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:58:31,068 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:58:31,068 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:58:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2018-11-18 23:58:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 23:58:31,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:31,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:31,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:31,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 765892228, now seen corresponding path program 1 times [2018-11-18 23:58:31,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:31,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:31,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {78#true} call ULTIMATE.init(); {78#true} is VALID [2018-11-18 23:58:31,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {78#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {78#true} is VALID [2018-11-18 23:58:31,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {78#true} assume true; {78#true} is VALID [2018-11-18 23:58:31,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {78#true} {78#true} #219#return; {78#true} is VALID [2018-11-18 23:58:31,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {78#true} call #t~ret33 := main(); {78#true} is VALID [2018-11-18 23:58:31,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {78#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {78#true} is VALID [2018-11-18 23:58:31,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {78#true} assume true; {78#true} is VALID [2018-11-18 23:58:31,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {78#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {78#true} is VALID [2018-11-18 23:58:31,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {78#true} assume !true; {79#false} is VALID [2018-11-18 23:58:31,302 INFO L256 TraceCheckUtils]: 9: Hoare triple {79#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {79#false} is VALID [2018-11-18 23:58:31,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {79#false} ~cond := #in~cond; {79#false} is VALID [2018-11-18 23:58:31,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {79#false} assume 0 == ~cond; {79#false} is VALID [2018-11-18 23:58:31,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {79#false} assume !false; {79#false} is VALID [2018-11-18 23:58:31,307 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:58:31,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:31,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:58:31,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 23:58:31,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:31,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:58:31,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:31,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:58:31,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:58:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:58:31,480 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 2 states. [2018-11-18 23:58:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:31,950 INFO L93 Difference]: Finished difference Result 144 states and 200 transitions. [2018-11-18 23:58:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:58:31,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 23:58:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:58:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2018-11-18 23:58:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:58:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2018-11-18 23:58:32,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 200 transitions. [2018-11-18 23:58:32,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:32,680 INFO L225 Difference]: With dead ends: 144 [2018-11-18 23:58:32,681 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 23:58:32,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:58:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 23:58:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 23:58:32,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:32,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:32,820 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:32,820 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:32,824 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 23:58:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 23:58:32,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:32,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:32,826 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:32,826 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:32,830 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 23:58:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 23:58:32,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:32,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:32,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:32,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 23:58:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 23:58:32,836 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2018-11-18 23:58:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:32,836 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 23:58:32,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:58:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 23:58:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:58:32,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:32,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:32,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:32,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1771472002, now seen corresponding path program 1 times [2018-11-18 23:58:32,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:32,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:32,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:32,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:32,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:33,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {338#true} call ULTIMATE.init(); {338#true} is VALID [2018-11-18 23:58:33,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {338#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {338#true} is VALID [2018-11-18 23:58:33,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {338#true} assume true; {338#true} is VALID [2018-11-18 23:58:33,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} #219#return; {338#true} is VALID [2018-11-18 23:58:33,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {338#true} call #t~ret33 := main(); {338#true} is VALID [2018-11-18 23:58:33,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {338#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {340#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:33,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {340#(<= 5 main_~n~0)} assume true; {340#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:33,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {340#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {341#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {341#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume true; {341#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {341#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume !(~j~0 <= ~n~0); {339#false} is VALID [2018-11-18 23:58:33,122 INFO L256 TraceCheckUtils]: 10: Hoare triple {339#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {339#false} is VALID [2018-11-18 23:58:33,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {339#false} ~cond := #in~cond; {339#false} is VALID [2018-11-18 23:58:33,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {339#false} assume 0 == ~cond; {339#false} is VALID [2018-11-18 23:58:33,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-11-18 23:58:33,125 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:58:33,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:33,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:58:33,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 23:58:33,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:33,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:58:33,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:33,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:58:33,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:58:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:58:33,221 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-11-18 23:58:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:33,484 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 23:58:33,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:58:33,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 23:58:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:58:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-18 23:58:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:58:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-18 23:58:33,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2018-11-18 23:58:33,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:33,612 INFO L225 Difference]: With dead ends: 43 [2018-11-18 23:58:33,613 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 23:58:33,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:58:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 23:58:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-18 23:58:33,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:33,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-18 23:58:33,636 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-18 23:58:33,636 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-18 23:58:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:33,639 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 23:58:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 23:58:33,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:33,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:33,640 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-18 23:58:33,640 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-18 23:58:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:33,643 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 23:58:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 23:58:33,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:33,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:33,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:33,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:58:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-18 23:58:33,646 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-18 23:58:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:33,646 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-18 23:58:33,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:58:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-18 23:58:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:58:33,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:33,648 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:33,648 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:33,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1929070916, now seen corresponding path program 1 times [2018-11-18 23:58:33,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:33,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:33,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2018-11-18 23:58:33,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {487#true} is VALID [2018-11-18 23:58:33,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2018-11-18 23:58:33,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #219#return; {487#true} is VALID [2018-11-18 23:58:33,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret33 := main(); {487#true} is VALID [2018-11-18 23:58:33,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {487#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {489#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:33,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {489#(<= 5 main_~n~0)} assume true; {489#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:33,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume true; {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:33,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {490#(and (= main_~j~0 0) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {491#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:33,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {491#(<= (+ main_~j~0 4) main_~n~0)} assume true; {491#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:33,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {491#(<= (+ main_~j~0 4) main_~n~0)} assume !(~j~0 <= ~n~0); {488#false} is VALID [2018-11-18 23:58:33,798 INFO L256 TraceCheckUtils]: 15: Hoare triple {488#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {488#false} is VALID [2018-11-18 23:58:33,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {488#false} ~cond := #in~cond; {488#false} is VALID [2018-11-18 23:58:33,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {488#false} assume 0 == ~cond; {488#false} is VALID [2018-11-18 23:58:33,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {488#false} assume !false; {488#false} is VALID [2018-11-18 23:58:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:33,802 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:33,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:33,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:34,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2018-11-18 23:58:34,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {487#true} is VALID [2018-11-18 23:58:34,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2018-11-18 23:58:34,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #219#return; {487#true} is VALID [2018-11-18 23:58:34,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret33 := main(); {487#true} is VALID [2018-11-18 23:58:34,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {487#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {489#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:34,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {489#(<= 5 main_~n~0)} assume true; {489#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:34,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:34,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume true; {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:34,067 INFO L273 TraceCheckUtils]: 9: Hoare triple {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:34,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:34,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:34,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {532#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:34,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {532#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume true; {532#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:34,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {532#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume !(~j~0 <= ~n~0); {488#false} is VALID [2018-11-18 23:58:34,071 INFO L256 TraceCheckUtils]: 15: Hoare triple {488#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {488#false} is VALID [2018-11-18 23:58:34,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {488#false} ~cond := #in~cond; {488#false} is VALID [2018-11-18 23:58:34,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {488#false} assume 0 == ~cond; {488#false} is VALID [2018-11-18 23:58:34,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {488#false} assume !false; {488#false} is VALID [2018-11-18 23:58:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:34,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:34,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 23:58:34,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-18 23:58:34,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:34,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:58:34,215 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:58:34,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:58:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:58:34,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:58:34,216 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2018-11-18 23:58:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:34,546 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-18 23:58:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:58:34,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-18 23:58:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:58:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 23:58:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:58:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-18 23:58:34,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-18 23:58:34,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:34,671 INFO L225 Difference]: With dead ends: 50 [2018-11-18 23:58:34,671 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 23:58:34,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:58:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 23:58:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-18 23:58:34,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:34,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 29 states. [2018-11-18 23:58:34,689 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 29 states. [2018-11-18 23:58:34,689 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 29 states. [2018-11-18 23:58:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:34,693 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-18 23:58:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 23:58:34,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:34,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:34,694 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 32 states. [2018-11-18 23:58:34,694 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 32 states. [2018-11-18 23:58:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:34,696 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-18 23:58:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 23:58:34,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:34,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:34,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:34,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:58:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 23:58:34,699 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 19 [2018-11-18 23:58:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:34,700 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 23:58:34,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:58:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 23:58:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:58:34,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:34,701 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:34,702 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:34,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 329177282, now seen corresponding path program 2 times [2018-11-18 23:58:34,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:34,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:34,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-18 23:58:34,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {718#true} is VALID [2018-11-18 23:58:34,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-18 23:58:34,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #219#return; {718#true} is VALID [2018-11-18 23:58:34,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret33 := main(); {718#true} is VALID [2018-11-18 23:58:34,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {718#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {718#true} is VALID [2018-11-18 23:58:34,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-18 23:58:34,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {718#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {718#true} is VALID [2018-11-18 23:58:34,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-18 23:58:34,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {718#true} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {718#true} is VALID [2018-11-18 23:58:34,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {718#true} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {720#(<= main_~i~0 main_~j~0)} is VALID [2018-11-18 23:58:34,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {720#(<= main_~i~0 main_~j~0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {720#(<= main_~i~0 main_~j~0)} is VALID [2018-11-18 23:58:34,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {720#(<= main_~i~0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {721#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2018-11-18 23:58:34,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {721#(<= (+ main_~i~0 1) main_~j~0)} assume true; {721#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2018-11-18 23:58:34,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {721#(<= (+ main_~i~0 1) main_~j~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {721#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2018-11-18 23:58:34,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {721#(<= (+ main_~i~0 1) main_~j~0)} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {719#false} is VALID [2018-11-18 23:58:34,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {719#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {719#false} is VALID [2018-11-18 23:58:34,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {719#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {719#false} is VALID [2018-11-18 23:58:34,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {719#false} assume true; {719#false} is VALID [2018-11-18 23:58:34,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {719#false} assume !(~j~0 <= ~n~0); {719#false} is VALID [2018-11-18 23:58:34,861 INFO L256 TraceCheckUtils]: 20: Hoare triple {719#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {719#false} is VALID [2018-11-18 23:58:34,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2018-11-18 23:58:34,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {719#false} assume 0 == ~cond; {719#false} is VALID [2018-11-18 23:58:34,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-18 23:58:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:34,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:34,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:58:34,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 23:58:34,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:34,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:58:34,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:34,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:58:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:58:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:58:34,898 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-18 23:58:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:35,032 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-18 23:58:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:58:35,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 23:58:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:58:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-18 23:58:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:58:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-18 23:58:35,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2018-11-18 23:58:35,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:35,166 INFO L225 Difference]: With dead ends: 68 [2018-11-18 23:58:35,166 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 23:58:35,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:58:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 23:58:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-18 23:58:35,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:35,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 38 states. [2018-11-18 23:58:35,211 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 38 states. [2018-11-18 23:58:35,211 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 38 states. [2018-11-18 23:58:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:35,214 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-18 23:58:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-18 23:58:35,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:35,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:35,216 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states. [2018-11-18 23:58:35,216 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states. [2018-11-18 23:58:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:35,218 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-18 23:58:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-18 23:58:35,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:35,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:35,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:35,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 23:58:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-18 23:58:35,222 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2018-11-18 23:58:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:35,223 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-18 23:58:35,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:58:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-18 23:58:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:58:35,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:35,224 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:35,224 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:35,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1009235652, now seen corresponding path program 1 times [2018-11-18 23:58:35,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:35,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:35,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {952#true} call ULTIMATE.init(); {952#true} is VALID [2018-11-18 23:58:35,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {952#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {952#true} is VALID [2018-11-18 23:58:35,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {952#true} assume true; {952#true} is VALID [2018-11-18 23:58:35,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {952#true} {952#true} #219#return; {952#true} is VALID [2018-11-18 23:58:35,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {952#true} call #t~ret33 := main(); {952#true} is VALID [2018-11-18 23:58:35,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {952#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {954#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:35,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {954#(<= 5 main_~n~0)} assume true; {954#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:35,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume true; {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {955#(and (= main_~j~0 0) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {956#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:35,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#(<= (+ main_~j~0 4) main_~n~0)} assume true; {956#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:35,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {956#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {956#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:35,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {956#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:35,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {956#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:35,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {957#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:35,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {957#(<= (+ main_~j~0 3) main_~n~0)} assume true; {957#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:35,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {957#(<= (+ main_~j~0 3) main_~n~0)} assume !(~j~0 <= ~n~0); {953#false} is VALID [2018-11-18 23:58:35,407 INFO L256 TraceCheckUtils]: 20: Hoare triple {953#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {953#false} is VALID [2018-11-18 23:58:35,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {953#false} ~cond := #in~cond; {953#false} is VALID [2018-11-18 23:58:35,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {953#false} assume 0 == ~cond; {953#false} is VALID [2018-11-18 23:58:35,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {953#false} assume !false; {953#false} is VALID [2018-11-18 23:58:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:35,410 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:35,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:35,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:35,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {952#true} call ULTIMATE.init(); {952#true} is VALID [2018-11-18 23:58:35,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {952#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {952#true} is VALID [2018-11-18 23:58:35,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {952#true} assume true; {952#true} is VALID [2018-11-18 23:58:35,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {952#true} {952#true} #219#return; {952#true} is VALID [2018-11-18 23:58:35,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {952#true} call #t~ret33 := main(); {952#true} is VALID [2018-11-18 23:58:35,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {952#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {954#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:35,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {954#(<= 5 main_~n~0)} assume true; {954#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:35,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume true; {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {982#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume true; {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume !(~i~0 == ~j~0); {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {998#(and (<= main_~j~0 1) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1014#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {1014#(and (<= main_~j~0 2) (<= 5 main_~n~0))} assume true; {1014#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:35,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {1014#(and (<= main_~j~0 2) (<= 5 main_~n~0))} assume !(~j~0 <= ~n~0); {953#false} is VALID [2018-11-18 23:58:35,787 INFO L256 TraceCheckUtils]: 20: Hoare triple {953#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {953#false} is VALID [2018-11-18 23:58:35,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {953#false} ~cond := #in~cond; {953#false} is VALID [2018-11-18 23:58:35,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {953#false} assume 0 == ~cond; {953#false} is VALID [2018-11-18 23:58:35,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {953#false} assume !false; {953#false} is VALID [2018-11-18 23:58:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:35,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:35,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 23:58:35,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-18 23:58:35,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:35,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:58:35,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:35,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:58:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:58:35,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:58:35,879 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-11-18 23:58:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:36,151 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2018-11-18 23:58:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:58:36,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-18 23:58:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:58:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-18 23:58:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:58:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-18 23:58:36,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-18 23:58:36,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:36,228 INFO L225 Difference]: With dead ends: 86 [2018-11-18 23:58:36,228 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 23:58:36,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:58:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 23:58:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-18 23:58:36,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:36,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 48 states. [2018-11-18 23:58:36,300 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 48 states. [2018-11-18 23:58:36,300 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 48 states. [2018-11-18 23:58:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:36,303 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-18 23:58:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 23:58:36,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:36,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:36,304 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 54 states. [2018-11-18 23:58:36,304 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 54 states. [2018-11-18 23:58:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:36,307 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-18 23:58:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 23:58:36,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:36,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:36,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:36,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 23:58:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-18 23:58:36,310 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2018-11-18 23:58:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:36,311 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-18 23:58:36,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:58:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 23:58:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:58:36,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:36,312 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:36,313 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:36,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1735689284, now seen corresponding path program 2 times [2018-11-18 23:58:36,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:36,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:36,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:36,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:36,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {1310#true} call ULTIMATE.init(); {1310#true} is VALID [2018-11-18 23:58:36,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {1310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1310#true} is VALID [2018-11-18 23:58:36,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {1310#true} assume true; {1310#true} is VALID [2018-11-18 23:58:36,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1310#true} {1310#true} #219#return; {1310#true} is VALID [2018-11-18 23:58:36,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {1310#true} call #t~ret33 := main(); {1310#true} is VALID [2018-11-18 23:58:36,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {1310#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1312#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:36,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {1312#(<= 5 main_~n~0)} assume true; {1312#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:36,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {1312#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:36,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume true; {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:36,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:36,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:36,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:36,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {1313#(and (= main_~j~0 0) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1314#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:36,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(<= (+ main_~j~0 4) main_~n~0)} assume true; {1314#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:36,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1314#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:36,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {1314#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:36,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {1314#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1314#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2018-11-18 23:58:36,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {1314#(<= (+ main_~j~0 4) main_~n~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1315#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:36,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= (+ main_~j~0 3) main_~n~0)} assume true; {1315#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:36,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {1315#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1315#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:36,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {1315#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {1315#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:36,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {1315#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1315#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2018-11-18 23:58:36,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {1315#(<= (+ main_~j~0 3) main_~n~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1316#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2018-11-18 23:58:36,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {1316#(<= (+ main_~j~0 2) main_~n~0)} assume true; {1316#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2018-11-18 23:58:36,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {1316#(<= (+ main_~j~0 2) main_~n~0)} assume !(~j~0 <= ~n~0); {1311#false} is VALID [2018-11-18 23:58:36,497 INFO L256 TraceCheckUtils]: 25: Hoare triple {1311#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1311#false} is VALID [2018-11-18 23:58:36,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {1311#false} ~cond := #in~cond; {1311#false} is VALID [2018-11-18 23:58:36,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {1311#false} assume 0 == ~cond; {1311#false} is VALID [2018-11-18 23:58:36,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2018-11-18 23:58:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:36,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:36,502 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:36,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:58:36,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:58:36,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:36,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:36,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {1310#true} call ULTIMATE.init(); {1310#true} is VALID [2018-11-18 23:58:36,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {1310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1310#true} is VALID [2018-11-18 23:58:36,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {1310#true} assume true; {1310#true} is VALID [2018-11-18 23:58:36,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1310#true} {1310#true} #219#return; {1310#true} is VALID [2018-11-18 23:58:36,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {1310#true} call #t~ret33 := main(); {1310#true} is VALID [2018-11-18 23:58:36,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {1310#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {1335#(<= main_~i~0 0)} assume true; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {1335#(<= main_~i~0 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {1335#(<= main_~i~0 0)} assume true; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {1335#(<= main_~i~0 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {1335#(<= main_~i~0 0)} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {1335#(<= main_~i~0 0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {1335#(<= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {1335#(<= main_~i~0 0)} assume true; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {1335#(<= main_~i~0 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(<= main_~i~0 0)} assume !(~i~0 == ~j~0); {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#(<= main_~i~0 0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {1335#(<= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {1335#(<= main_~i~0 0)} assume true; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {1335#(<= main_~i~0 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {1335#(<= main_~i~0 0)} assume !(~i~0 == ~j~0); {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {1335#(<= main_~i~0 0)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {1335#(<= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {1335#(<= main_~i~0 0)} assume true; {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {1335#(<= main_~i~0 0)} assume !(~j~0 <= ~n~0); {1335#(<= main_~i~0 0)} is VALID [2018-11-18 23:58:36,708 INFO L256 TraceCheckUtils]: 25: Hoare triple {1335#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1396#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:58:36,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {1396#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1400#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:58:36,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {1400#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1311#false} is VALID [2018-11-18 23:58:36,712 INFO L273 TraceCheckUtils]: 28: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2018-11-18 23:58:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 23:58:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:58:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-18 23:58:36,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-18 23:58:36,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:36,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:58:36,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:36,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:58:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:58:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:58:36,783 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 10 states. [2018-11-18 23:58:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:38,326 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2018-11-18 23:58:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 23:58:38,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-18 23:58:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:58:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2018-11-18 23:58:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:58:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2018-11-18 23:58:38,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 110 transitions. [2018-11-18 23:58:38,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:38,503 INFO L225 Difference]: With dead ends: 161 [2018-11-18 23:58:38,503 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 23:58:38,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:58:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 23:58:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2018-11-18 23:58:38,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:38,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 101 states. [2018-11-18 23:58:38,644 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 101 states. [2018-11-18 23:58:38,645 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 101 states. [2018-11-18 23:58:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:38,650 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-11-18 23:58:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-11-18 23:58:38,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:38,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:38,651 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 119 states. [2018-11-18 23:58:38,651 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 119 states. [2018-11-18 23:58:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:38,656 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-11-18 23:58:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-11-18 23:58:38,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:38,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:38,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:38,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 23:58:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-11-18 23:58:38,662 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 29 [2018-11-18 23:58:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:38,662 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-11-18 23:58:38,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:58:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-18 23:58:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 23:58:38,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:38,664 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:38,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:38,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1288755476, now seen corresponding path program 1 times [2018-11-18 23:58:38,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:38,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:38,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:38,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {1989#true} is VALID [2018-11-18 23:58:38,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {1989#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1989#true} is VALID [2018-11-18 23:58:38,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2018-11-18 23:58:38,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #219#return; {1989#true} is VALID [2018-11-18 23:58:38,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret33 := main(); {1989#true} is VALID [2018-11-18 23:58:38,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {1989#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {1991#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {1991#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {1991#(<= main_~n~0 5)} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {1991#(<= main_~n~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {1991#(<= main_~n~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {1991#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {1991#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {1991#(<= main_~n~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {1991#(<= main_~n~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {1991#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {1991#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {1991#(<= main_~n~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {1991#(<= main_~n~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {1991#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {1991#(<= main_~n~0 5)} assume !(~i~0 == ~j~0); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {1991#(<= main_~n~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {1991#(<= main_~n~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#(<= main_~n~0 5)} assume !(~j~0 <= ~n~0); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,914 INFO L256 TraceCheckUtils]: 30: Hoare triple {1991#(<= main_~n~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1989#true} is VALID [2018-11-18 23:58:38,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#true} ~cond := #in~cond; {1992#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-18 23:58:38,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {1992#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1993#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:58:38,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {1993#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1993#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:58:38,918 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1993#(not (= |__VERIFIER_assert_#in~cond| 0))} {1991#(<= main_~n~0 5)} #223#return; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,919 INFO L273 TraceCheckUtils]: 35: Hoare triple {1991#(<= main_~n~0 5)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {1991#(<= main_~n~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {1991#(<= main_~n~0 5)} assume true; {1991#(<= main_~n~0 5)} is VALID [2018-11-18 23:58:38,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {1991#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {1994#(<= main_~i~0 5)} assume true; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {1994#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {1994#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,927 INFO L273 TraceCheckUtils]: 42: Hoare triple {1994#(<= main_~i~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,927 INFO L273 TraceCheckUtils]: 43: Hoare triple {1994#(<= main_~i~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {1994#(<= main_~i~0 5)} assume true; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {1994#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,930 INFO L273 TraceCheckUtils]: 46: Hoare triple {1994#(<= main_~i~0 5)} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,930 INFO L273 TraceCheckUtils]: 47: Hoare triple {1994#(<= main_~i~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,931 INFO L273 TraceCheckUtils]: 48: Hoare triple {1994#(<= main_~i~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,932 INFO L273 TraceCheckUtils]: 49: Hoare triple {1994#(<= main_~i~0 5)} assume true; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,933 INFO L273 TraceCheckUtils]: 50: Hoare triple {1994#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {1994#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {1994#(<= main_~i~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {1994#(<= main_~i~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {1994#(<= main_~i~0 5)} assume true; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,976 INFO L273 TraceCheckUtils]: 55: Hoare triple {1994#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,976 INFO L273 TraceCheckUtils]: 56: Hoare triple {1994#(<= main_~i~0 5)} assume !(~i~0 == ~j~0); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,978 INFO L273 TraceCheckUtils]: 57: Hoare triple {1994#(<= main_~i~0 5)} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,983 INFO L273 TraceCheckUtils]: 58: Hoare triple {1994#(<= main_~i~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,987 INFO L273 TraceCheckUtils]: 59: Hoare triple {1994#(<= main_~i~0 5)} assume true; {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {1994#(<= main_~i~0 5)} assume !(~j~0 <= ~n~0); {1994#(<= main_~i~0 5)} is VALID [2018-11-18 23:58:38,993 INFO L256 TraceCheckUtils]: 61: Hoare triple {1994#(<= main_~i~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1993#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-18 23:58:38,994 INFO L273 TraceCheckUtils]: 62: Hoare triple {1993#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1995#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-18 23:58:38,994 INFO L273 TraceCheckUtils]: 63: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1990#false} is VALID [2018-11-18 23:58:38,994 INFO L273 TraceCheckUtils]: 64: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2018-11-18 23:58:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 1 proven. 100 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 23:58:38,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:38,999 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:39,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:39,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:39,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {1989#true} call ULTIMATE.init(); {1989#true} is VALID [2018-11-18 23:58:39,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {1989#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1989#true} is VALID [2018-11-18 23:58:39,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {1989#true} assume true; {1989#true} is VALID [2018-11-18 23:58:39,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1989#true} {1989#true} #219#return; {1989#true} is VALID [2018-11-18 23:58:39,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {1989#true} call #t~ret33 := main(); {1989#true} is VALID [2018-11-18 23:58:39,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {1989#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2014#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:39,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {2014#(<= 5 main_~n~0)} assume true; {2014#(<= 5 main_~n~0)} is VALID [2018-11-18 23:58:39,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {2014#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:39,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume true; {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:39,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:39,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:39,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:39,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {2021#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume true; {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} assume !(~i~0 == ~j~0); {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,449 INFO L273 TraceCheckUtils]: 17: Hoare triple {2037#(and (<= main_~j~0 1) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} assume true; {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,450 INFO L273 TraceCheckUtils]: 19: Hoare triple {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} assume !(~i~0 == ~j~0); {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {2053#(and (<= main_~j~0 2) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} assume true; {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} assume !(~i~0 == ~j~0); {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {2069#(and (<= main_~j~0 3) (<= 5 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2085#(and (<= main_~j~0 4) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {2085#(and (<= main_~j~0 4) (<= 5 main_~n~0))} assume true; {2085#(and (<= main_~j~0 4) (<= 5 main_~n~0))} is VALID [2018-11-18 23:58:39,459 INFO L273 TraceCheckUtils]: 29: Hoare triple {2085#(and (<= main_~j~0 4) (<= 5 main_~n~0))} assume !(~j~0 <= ~n~0); {1990#false} is VALID [2018-11-18 23:58:39,459 INFO L256 TraceCheckUtils]: 30: Hoare triple {1990#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1990#false} is VALID [2018-11-18 23:58:39,460 INFO L273 TraceCheckUtils]: 31: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2018-11-18 23:58:39,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {1990#false} assume !(0 == ~cond); {1990#false} is VALID [2018-11-18 23:58:39,460 INFO L273 TraceCheckUtils]: 33: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,460 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1990#false} {1990#false} #223#return; {1990#false} is VALID [2018-11-18 23:58:39,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {1990#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1990#false} is VALID [2018-11-18 23:58:39,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {1990#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1990#false} is VALID [2018-11-18 23:58:39,461 INFO L273 TraceCheckUtils]: 37: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,461 INFO L273 TraceCheckUtils]: 38: Hoare triple {1990#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1990#false} is VALID [2018-11-18 23:58:39,462 INFO L273 TraceCheckUtils]: 39: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,462 INFO L273 TraceCheckUtils]: 40: Hoare triple {1990#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1990#false} is VALID [2018-11-18 23:58:39,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {1990#false} assume !(~i~0 == ~j~0); {1990#false} is VALID [2018-11-18 23:58:39,462 INFO L273 TraceCheckUtils]: 42: Hoare triple {1990#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1990#false} is VALID [2018-11-18 23:58:39,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {1990#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1990#false} is VALID [2018-11-18 23:58:39,463 INFO L273 TraceCheckUtils]: 44: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,463 INFO L273 TraceCheckUtils]: 45: Hoare triple {1990#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1990#false} is VALID [2018-11-18 23:58:39,463 INFO L273 TraceCheckUtils]: 46: Hoare triple {1990#false} assume ~i~0 == ~j~0;call #t~mem2 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem2, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem2; {1990#false} is VALID [2018-11-18 23:58:39,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {1990#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1990#false} is VALID [2018-11-18 23:58:39,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {1990#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1990#false} is VALID [2018-11-18 23:58:39,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {1990#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1990#false} is VALID [2018-11-18 23:58:39,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {1990#false} assume !(~i~0 == ~j~0); {1990#false} is VALID [2018-11-18 23:58:39,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {1990#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1990#false} is VALID [2018-11-18 23:58:39,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {1990#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1990#false} is VALID [2018-11-18 23:58:39,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {1990#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1990#false} is VALID [2018-11-18 23:58:39,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {1990#false} assume !(~i~0 == ~j~0); {1990#false} is VALID [2018-11-18 23:58:39,466 INFO L273 TraceCheckUtils]: 57: Hoare triple {1990#false} call #t~mem3 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem3);havoc #t~mem3; {1990#false} is VALID [2018-11-18 23:58:39,466 INFO L273 TraceCheckUtils]: 58: Hoare triple {1990#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1990#false} is VALID [2018-11-18 23:58:39,466 INFO L273 TraceCheckUtils]: 59: Hoare triple {1990#false} assume true; {1990#false} is VALID [2018-11-18 23:58:39,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {1990#false} assume !(~j~0 <= ~n~0); {1990#false} is VALID [2018-11-18 23:58:39,466 INFO L256 TraceCheckUtils]: 61: Hoare triple {1990#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1990#false} is VALID [2018-11-18 23:58:39,466 INFO L273 TraceCheckUtils]: 62: Hoare triple {1990#false} ~cond := #in~cond; {1990#false} is VALID [2018-11-18 23:58:39,467 INFO L273 TraceCheckUtils]: 63: Hoare triple {1990#false} assume 0 == ~cond; {1990#false} is VALID [2018-11-18 23:58:39,467 INFO L273 TraceCheckUtils]: 64: Hoare triple {1990#false} assume !false; {1990#false} is VALID [2018-11-18 23:58:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 100 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 23:58:39,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:39,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-18 23:58:39,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-18 23:58:39,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:39,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:58:39,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:39,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:58:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:58:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:58:39,594 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 13 states. [2018-11-18 23:58:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:40,420 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2018-11-18 23:58:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:58:40,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-18 23:58:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:58:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-18 23:58:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:58:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-18 23:58:40,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-18 23:58:40,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:40,510 INFO L225 Difference]: With dead ends: 229 [2018-11-18 23:58:40,510 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:58:40,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-11-18 23:58:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:58:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:58:40,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:40,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:40,513 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:40,513 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:40,513 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:58:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:40,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:40,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:40,514 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:40,514 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:40,514 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:58:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:40,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:40,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:40,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:40,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:58:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:58:40,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-11-18 23:58:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:40,516 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:58:40,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:58:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:40,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:40,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:58:40,692 INFO L425 ceAbstractionStarter]: For program point L44-1(lines 44 62) no Hoare annotation was computed. [2018-11-18 23:58:40,692 INFO L425 ceAbstractionStarter]: For program point L44-3(lines 44 62) no Hoare annotation was computed. [2018-11-18 23:58:40,692 INFO L428 ceAbstractionStarter]: At program point L44-4(lines 44 62) the Hoare annotation is: true [2018-11-18 23:58:40,692 INFO L425 ceAbstractionStarter]: For program point L44-5(lines 44 62) no Hoare annotation was computed. [2018-11-18 23:58:40,692 INFO L425 ceAbstractionStarter]: For program point ludcmpEXIT(lines 39 80) no Hoare annotation was computed. [2018-11-18 23:58:40,692 INFO L428 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: true [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2018-11-18 23:58:40,693 INFO L428 ceAbstractionStarter]: At program point ludcmpENTRY(lines 39 80) the Hoare annotation is: true [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point L55-3(lines 55 61) no Hoare annotation was computed. [2018-11-18 23:58:40,693 INFO L428 ceAbstractionStarter]: At program point L55-4(lines 55 61) the Hoare annotation is: true [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 54) no Hoare annotation was computed. [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point L47-3(lines 47 54) no Hoare annotation was computed. [2018-11-18 23:58:40,693 INFO L428 ceAbstractionStarter]: At program point L47-4(lines 47 54) the Hoare annotation is: true [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point L47-5(lines 47 54) no Hoare annotation was computed. [2018-11-18 23:58:40,693 INFO L425 ceAbstractionStarter]: For program point ludcmpFINAL(lines 39 80) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 72 78) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L72-3(lines 72 78) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L428 ceAbstractionStarter]: At program point L72-4(lines 72 78) the Hoare annotation is: true [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L72-5(lines 72 78) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 64 70) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L64-3(lines 64 70) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L428 ceAbstractionStarter]: At program point L64-4(lines 64 70) the Hoare annotation is: true [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L64-5(lines 64 70) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 58 59) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L58-3(lines 58 59) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L428 ceAbstractionStarter]: At program point L58-4(lines 58 59) the Hoare annotation is: true [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L58-5(lines 58 59) no Hoare annotation was computed. [2018-11-18 23:58:40,694 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 50 52) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 75 76) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L75-3(lines 75 76) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L428 ceAbstractionStarter]: At program point L75-4(lines 75 76) the Hoare annotation is: true [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L75-5(lines 75 76) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 67 68) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L428 ceAbstractionStarter]: At program point L67-4(lines 67 68) the Hoare annotation is: true [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L67-5(lines 67 68) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 52) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L425 ceAbstractionStarter]: For program point L51-3(lines 51 52) no Hoare annotation was computed. [2018-11-18 23:58:40,695 INFO L428 ceAbstractionStarter]: At program point L51-4(lines 51 52) the Hoare annotation is: true [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:58:40,696 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 15) no Hoare annotation was computed. [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point fabsEXIT(lines 11 17) no Hoare annotation was computed. [2018-11-18 23:58:40,696 INFO L428 ceAbstractionStarter]: At program point fabsENTRY(lines 11 17) the Hoare annotation is: true [2018-11-18 23:58:40,696 INFO L425 ceAbstractionStarter]: For program point fabsFINAL(lines 11 17) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:58:40,697 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 18 38) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-18 23:58:40,697 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2018-11-18 23:58:40,698 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (and (<= main_~n~0 5) (<= 5 main_~n~0)) [2018-11-18 23:58:40,698 INFO L428 ceAbstractionStarter]: At program point L23-5(lines 23 34) the Hoare annotation is: true [2018-11-18 23:58:40,698 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 18 38) no Hoare annotation was computed. [2018-11-18 23:58:40,698 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-11-18 23:58:40,698 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 18 38) the Hoare annotation is: true [2018-11-18 23:58:40,698 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2018-11-18 23:58:40,698 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 31) no Hoare annotation was computed. [2018-11-18 23:58:40,698 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 31) the Hoare annotation is: (and (<= main_~n~0 5) (<= main_~i~0 5) (<= 5 main_~n~0)) [2018-11-18 23:58:40,698 INFO L421 ceAbstractionStarter]: At program point L26-5(lines 26 31) the Hoare annotation is: (and (<= main_~n~0 5) (<= main_~i~0 5) (<= 5 main_~n~0)) [2018-11-18 23:58:40,699 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-18 23:58:40,699 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 23:58:40,699 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 23:58:40,699 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:58:40,699 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 23:58:40,699 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 23:58:40,699 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:58:40,701 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-18 23:58:40,701 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:58:40,701 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 23:58:40,702 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:58:40,702 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-18 23:58:40,702 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-18 23:58:40,702 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:58:40,702 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-18 23:58:40,703 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2018-11-18 23:58:40,704 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:58:40,705 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 23:58:40,705 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 23:58:40,705 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-11-18 23:58:40,705 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 23:58:40,705 WARN L170 areAnnotationChecker]: L64-5 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L64-5 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:58:40,706 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L72-5 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2018-11-18 23:58:40,707 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L72-5 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2018-11-18 23:58:40,708 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L75-5 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-18 23:58:40,709 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L75-5 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L58-5 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2018-11-18 23:58:40,710 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-18 23:58:40,711 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-18 23:58:40,711 WARN L170 areAnnotationChecker]: L58-5 has no Hoare annotation [2018-11-18 23:58:40,711 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2018-11-18 23:58:40,711 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2018-11-18 23:58:40,711 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:58:40,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:58:40 BoogieIcfgContainer [2018-11-18 23:58:40,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:58:40,724 INFO L168 Benchmark]: Toolchain (without parser) took 11814.26 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -695.3 MB). Peak memory consumption was 161.9 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:40,726 INFO L168 Benchmark]: CDTParser took 0.20 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:58:40,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.26 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:58:40,727 INFO L168 Benchmark]: Boogie Preprocessor took 100.73 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:58:40,728 INFO L168 Benchmark]: RCFGBuilder took 1537.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -742.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:40,729 INFO L168 Benchmark]: TraceAbstraction took 9730.89 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 136.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 162.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:40,733 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.20 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 440.26 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 100.73 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. * RCFGBuilder took 1537.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -742.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9730.89 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 136.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 162.2 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: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (n <= 5 && i <= 5) && 5 <= n - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: n <= 5 && 5 <= n - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 75 locations, 1 error locations. SAFE Result, 9.6s OverallTime, 7 OverallIterations, 10 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 212 SDslu, 355 SDs, 0 SdLazy, 279 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=6, 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.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 42 PreInvPairs, 83 NumberOfFragments, 45 HoareAnnotationTreeSize, 42 FomulaSimplifications, 691 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 325 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 37426 SizeOfPredicates, 8 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 250/431 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...